Magic Adversaries Versus Individual Reduction: Science Wins Either Way

DOI10.1007/978-3-319-56614-6_12zbMath1415.94422OpenAlexW2584176762MaRDI QIDQ5738980

Yi Deng

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_12

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

A note on non-interactive zero-knowledge from CDH ⋮ Individual simulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform-complexity treatment of encryption and zero-knowledge
• How to construct constant-round zero-knowledge proof systems for NP
• Practical chosen ciphertext secure encryption from factoring
• Lower bounds and impossibility results for concurrent self composition
• On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs
• What Information Is Leaked under Concurrent Composition?
• Notions of Black-Box Reductions, Revisited
• Concurrently Secure Computation in Constant Rounds
• On the power of nonuniformity in proofs of security
• General Hardness Amplification of Predicates and Puzzles
• On Yao’s XOR-Lemma
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
• Magic Functions
• Concurrent Secure Computation via Non-Black Box Simulation
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
• Universally composable two-party and multi-party secure computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• Limits of Constructive Security Proofs
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• On the existence of extractable one-way functions
• From Weak to Strong Zero-Knowledge and Applications
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
• Non-black-box simulation in the fully concurrent setting
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: Magic Adversaries Versus Individual Reduction: Science Wins Either Way