Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
From MaRDI portal
Publication:6108994
DOI10.1007/978-3-031-15982-4_18zbMath1517.94079arXiv2111.08665OpenAlexW3215949210MaRDI QIDQ6108994
Takashi Yamakawa, Kai-Min Chung, Xiao Liang, Nai-Hui Chia
Publication date: 30 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.08665
Related Items
Cites Work
- A note on constant-round zero-knowledge proofs of knowledge
- Bit commitment using pseudorandomness
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- A new approach to black-box concurrent secure computation
- On the existence of three round zero-knowledge proofs
- How to construct constant-round zero-knowledge proof systems for NP
- Secure multi-party quantum computation with a dishonest majority
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Black-box non-interactive non-malleable commitments
- Round-optimal black-box commit-and-prove with succinct communication
- Black-box constructions of bounded-concurrent secure computation
- Secure quantum extraction protocols
- A black-box approach to post-quantum zero-knowledge in constant rounds
- On the concurrent composition of quantum zero-knowledge
- One-way functions imply secure computation in a quantum world
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Non-malleable commitments against quantum attacks
- On the Power of Secure Two-Party Computation
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Concurrently Secure Computation in Constant Rounds
- Quantum Proofs of Knowledge
- Black-Box Constructions of Composable Protocols without Set-Up
- Black-box constructions for secure computation
- Zero-knowledge against quantum attacks
- Limitations of Quantum Advice and One-Way Communication
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications
- Black-Box Constructions of Protocols for Secure Computation
- Secure Multiparty RAM Computation in Constant Rounds
- Improving the Security of Quantum Protocols via Commit-and-Open
- Sampling in a Quantum Population, and Applications
- Founding Cryptography on Oblivious Transfer – Efficiently
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- The Wire-Tap Channel
- Nonmalleable Cryptography
- Post-quantum zero knowledge in constant rounds
- Classical Cryptographic Protocols in a Quantum World
- Multi-collision resistance: a paradigm for keyless hash functions
- Black-box non-black-box zero knowledge
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Constant round non-malleable protocols using one way functions
- Concurrent zero-knowledge
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
