Two Party RSA Key Generation
- 16 December 1999
- book chapter
- Published by Springer Nature
- p. 116-129
- https://doi.org/10.1007/3-540-48405-1_8
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Oblivious transfer and polynomial evaluationPublished by Association for Computing Machinery (ACM) ,1999
- Computationally Private Information Retrieval with Polylogarithmic CommunicationPublished by Springer Nature ,1999
- Protecting data privacy in private information retrieval schemesPublished by Association for Computing Machinery (ACM) ,1998
- Generation of Shared RSA Keys by Two PartiesPublished by Springer Nature ,1998
- Efficient generation of shared RSA keysPublished by Springer Nature ,1997
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984