How to generate and exchange secrets
Explore this paper's citation graph
- Type
- article
- Published
- 1986-10-27
- Cited by
- 2,235
- References
- 19
- OpenAlex
- https://openalex.org/W2088492763
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:52818943
Keywords
Cryptography, Integer factorization, Computer science, Factoring, Oblivious transfer
References
- Coin flipping by telephone a protocol for solving impossible problems
- How to exchange (secret) keys
- Limits on the security of coin flips when half the processors are faulty
- Probabilistic encryption & how to play mental poker keeping secret all partial information
- Trapdoor pseudo-random number generators, with applications to protocol design
- Theory and application of trapdoor functions
- RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
- The cryptographic security of truncated linearly related variables
- Protocols for secure computations
- A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
- How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
- Theory and application of trapdoor functions
- How to exchange (secret) keys
- and as an in
- How to Exchange Half a Bit
Cited by
- Enabling Privacy for the Paranoids
- Secure Count Query on Encrypted Genomic Data
- Hidden Credential Retrieval without Random Oracles
- A new multi party aggregation algorithm using infinite product series
- Exploring Trusted Platform Module Capabilities: A Theoretical and Experimental Study
- Privacy Preserving Data Mining (Advances in Information Security)
- Delegació verificable del càlcul de polinomis
- Secret charing vs. encryption-based techniques for privacy preserving data mining
- Classification Spanning Private Databases
- Trail re-identification and unlinkability in distributed databases
- Features of computer language: communication of computers and its complexity.
- Data Security in Service-Oriented Architectures
- Secure Collaborative Planning, Forecasting, and Replenishment (SCPFR)
- Black-box complexity of encryption and commitment
- Privacy preserving data sharing in data mining environment
- A Note on Secure Multiparty Multiplication
- A General Framework for Multiparty Computations
- On Hiding Information from an Oracle
- Data transformation for privacy-preserving data mining
- Achieving Higher-Fidelity Conjunction Analyses Using Cryptography to Improve Information Sharing
Related papers
- Fundamental Structure of Shor’s Quantum Algorithm for Factoring Integers
- A New Factorization Method to Factorize RSA Public Key Encryption
- P System Design for Integer Factorization
- An Efficient Method to Factorize the RSA Public Key Encryption
- A Novel Calculation Method for the Factorization of Large Integr al Numbers and the Decoding of the RSA Cryptosystem
- The Number Field Sieve
- Advances in composite integer factorization