Cryptology ePrint Archive: Report 2000/038
Available versions in chronological order
20000727:155815 (posted 27-Jul-2000 15:58:15 UTC)
On the Complexity of Verifiable Secret Sharing and Multi-Party Computation
Ronald Cramer and Ivan Damg{\aa}rd and Stefan Dziembowski
Publication Info: Appears in the Proceedings of STOC '00, ACM, May 2000.
[
Cryptology ePrint archive
]