Key-agreement with perfect completeness from random oracles
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A note on perfect correctness by derandomization
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Amplification of Chosen-Ciphertext Security
- Communication lower bounds of key-agreement protocols via density increment arguments
- scientific article; zbMATH DE number 1088229 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Limits on the usefulness of random oracles
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- More on average case vs approximation complexity
- New directions in cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the Communication Complexity of Key-Agreement Protocols.
- On the importance of eliminating errors in cryptographic computations
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-key cryptography from different assumptions
- Public-key encryption from homogeneous CLWE
- Secure communications over insecure channels
This page was built for publication: Key-agreement with perfect completeness from random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299431)
