Multiparty Computation from Threshold Homomorphic Encryption
Top Cited Papers
- 15 April 2001
- book chapter
- Published by Springer Nature
- Vol. 2000, 280-300
- https://doi.org/10.1007/3-540-44987-6_18
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Sharing Decryption in the Context of Voting or LotteriesPublished by Springer Nature ,2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Nature ,2001
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemePublished by Springer Nature ,2000
- Practical Threshold SignaturesPublished by Springer Nature ,2000
- Multiparty Computation from Threshold Homomorphic EncryptionBRICS Report Series, 2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Published by Springer Nature ,1998
- Joint Encryption and Message-Efficient Secure ComputationJournal of Cryptology, 1996
- Non-cryptographic fault-tolerant computing in constant number of rounds of interactionPublished by Association for Computing Machinery (ACM) ,1989
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987