From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
- 16 April 2023
- book chapter
- Published by Springer Nature
- p. 639-667
Abstract
No abstract availableKeywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Quantum Commitments from Complexity Assumptions2011
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- How to Convert the Flavor of a Quantum Bit Commitment2001
- Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation2000
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- New directions in cryptographyIEEE Transactions on Information Theory, 1976