Efficient generation of shared RSA keys
- 1 January 1997
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 425-439
- https://doi.org/10.1007/bfb0052253
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Comparing information without leaking itCommunications of the ACM, 1996
- Joint Encryption and Message-Efficient Secure ComputationJournal of Cryptology, 1996
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977