Resettable zero-knowledge (extended abstract)
From MaRDI portal
Publication:3191990
DOI10.1145/335305.335334zbMath1296.94093OpenAlexW2074929468MaRDI QIDQ3191990
Shafi Goldwasser, Oded Goldreich, Ran Canetti, Silvio Micali
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335334
public-key cryptographyidentification schemeszero-knowledgesmart cardsconcurrent zero-knowledgewitness-indistinguisable proofs
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Threshold Schnorr with stateless deterministic signing from standard assumptions, Concurrent knowledge extraction in public-key models, On QA-NIZK in the BPK Model, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, Pattern matching on encrypted streams, Separating Computational and Statistical Differential Privacy in the Client-Server Model, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, On the impossibility of cryptography with tamperable randomness, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Indistinguishable Proofs of Work or Knowledge, Non-black-box simulation in the fully concurrent setting, revisited, Smooth zero-knowledge hash functions, Individual simulations, Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model, Post-quantum resettably-sound zero knowledge, Leakproof secret sharing protocols with applications to group identification scheme, Non-interactive secure computation from one-way functions, Impossibility results for universal composability in public-key models and with fixed inputs, Concurrent zero knowledge, revisited, (2+\(f\)(\(n\)))-SAT and its properties., Random walks and concurrent zero-knowledge, Efficient non-malleable commitment schemes, Lower bounds for non-black-box zero knowledge, Efficient non-malleable commitment schemes, On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits, Unclonable Group Identification, Online-Untransferable Signatures, Improved OR-Composition of Sigma-Protocols, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, On subversion-resistant SNARKs, Resettably Secure Computation, Minicrypt primitives with algebraic structure and applications, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Handling expected polynomial-time strategies in simulation-based security proofs, Co-sound Zero-Knowledge with Public Keys, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, Concurrent Non-Malleable Commitments (and More) in 3 Rounds, On the Necessary and Sufficient Assumptions for UC Computation, Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs, Founding Cryptography on Tamper-Proof Hardware Tokens, Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs, Pseudorandom Functions: Three Decades Later, Weak Zero-Knowledge beyond the Black-Box Barrier
