Concurrent knowledge extraction in public-key models
From MaRDI portal
Publication:271592
DOI10.1007/s00145-014-9191-zzbMath1351.94072OpenAlexW3103972512MaRDI QIDQ271592
Yunlei Zhao, Andrew Chi-Chih Yao, Mordechai M. Yung
Publication date: 7 April 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9191-z
bare public keycomplexity leveragingproof of knowledgestrong witness indistinguishabilitywitness-extended emulatorzero knowledge
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on constant-round zero-knowledge proofs of knowledge
- Bit commitment using pseudorandomness
- Minimum disclosure proofs of knowledge
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Efficient signature generation by smart cards
- Parallel coin-tossing and constant-round secure two-party computation
- How to construct constant-round zero-knowledge proof systems for NP
- Concurrent zero knowledge, revisited
- Lower bounds for non-black-box zero knowledge
- Constant-Round Concurrent Zero Knowledge in the Bounded Player Model
- Formalizing Human Ignorance
- Simultaneously Resettable Arguments of Knowledge
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge
- Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge
- Resettable zero-knowledge (extended abstract)
- An Efficient Parallel Repetition Theorem
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Concurrent Nonmalleable Commitments
- Concurrent Knowledge Extraction in the Public-Key Model
- Efficient Zero Knowledge on the Internet
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Universal Arguments and their Applications
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Breaking RSA may not be equivalent to factoring
- A Pseudorandom Generator from any One-way Function
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- The knowledge complexity of interactive proof-systems
- Nonmalleable Cryptography
- Strict Polynomial-Time in Simulation and Extraction
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Concurrent Zero Knowledge in the Bounded Player Model
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Advances in Cryptology – CRYPTO 2004
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Constant-round non-malleable commitments from any one-way function
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Automata, Languages and Programming
- 4-Round Resettably-Sound Zero Knowledge
- Theory of Cryptography
This page was built for publication: Concurrent knowledge extraction in public-key models
