Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- 1 January 2012
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- On the Amortized Complexity of Zero-Knowledge ProtocolsLecture Notes in Computer Science, 2009
- Efficient Two-Party Secure Computation on Committed InputsLecture Notes in Computer Science, 2007
- On Diophantine Complexity and Statistical Zero-Knowledge ArgumentsLecture Notes in Computer Science, 2003
- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic EncryptionLecture Notes in Computer Science, 2003
- Efficient generation of shared RSA keysJournal of the ACM, 2001
- Robust Threshold DSS SignaturesInformation and Computation, 2001
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Threshold cryptographyEuropean Transactions on Telecommunications, 1994
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Zero-knowledge proofs of identityJournal of Cryptology, 1988