Unconditionally secure commitments with quantum auxiliary inputs
From MaRDI portal
(Redirected from Publication:6653002)
Cites work
- A Pseudorandom Generator from any One-way Function
- An Unconditional Study of Computational Zero Knowledge
- Bit commitment using pseudorandomness
- Computationally binding quantum commitments
- Cryptography from pseudorandom quantum states
- Founding Cryptography on Oblivious Transfer – Efficiently
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- General properties of quantum bit commitments (extended abstract)
- scientific article; zbMATH DE number 1722671 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 845842 (Why is no real title available?)
- scientific article; zbMATH DE number 7759460 (Why is no real title available?)
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- Non-uniformity and quantum advice in the quantum random oracle model
- Oblivious transfer is in MiniQCrypt
- On the computational hardness needed for quantum cryptography
- On the necessity of collapsing for post-quantum and quantum commitments
- On the power of correlated randomness in secure computation
- One-way functions imply secure computation in a quantum world
- Perfectly concealing quantum bit commitment from any quantum one-way permutation
- Pseudorandom quantum states
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum commitments and signatures without one-way functions
- Quantum commitments from complexity assumptions
- Quantum random oracle model with auxiliary input
- Secure identity-based encryption in the quantum random oracle model
- Secure multi-party quantum computation with a dishonest majority
- Sparse pseudorandom distributions
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- The transition probability in the state space of a \(^*\)-algebra
- The Knowledge Complexity of Interactive Proof Systems
- Trace distance from the viewpoint of quantum operation techniques
This page was built for publication: Unconditionally secure commitments with quantum auxiliary inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653002)
