scientific article
From MaRDI portal
Publication:3210166
zbMath0722.68045MaRDI QIDQ3210166
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)
Related Items
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Concurrent knowledge extraction in public-key models ⋮ New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Protocols for collusion-secure asymmetric fingerprinting ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Round-optimal zero-knowledge proofs of knowledge for NP ⋮ Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems ⋮ A note on constant-round zero-knowledge proofs of knowledge ⋮ Communication efficient Zero-knowledge Proofs of knowledge ⋮ Precise zero-knowledge arguments with poly-logarithmic efficiency ⋮ Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ Existence of 3-round zero-knowledge proof systems for NP ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Individual simulations ⋮ Concurrent composition of differential privacy ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Practic zero-knowledge proofs: Giving hints and using deficiencies ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ A language-dependent cryptographic primitive ⋮ Efficient non-malleable commitment schemes ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ The Knowledge Complexity of Interactive Proof Systems ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ Efficient non-malleable commitment schemes ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ On the power of secure two-party computation ⋮ Strong Proofs of Knowledge ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Handling expected polynomial-time strategies in simulation-based security proofs ⋮ Precise Time and Space Simulatable Zero-Knowledge ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ On the Power of Secure Two-Party Computation ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Composition of Zero-Knowledge Proofs with Efficient Provers ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Adaptively secure distributed public-key systems. ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Constant-round perfect zero-knowledge computationally convincing protocols
