Resettable zero-knowledge (extended abstract)

DOI10.1145/335305.335334zbMATH Open1296.94093OpenAlexW2074929468MaRDI QIDQ3191990FDOQ3191990

Authors: Ran Canetti, Oded Goldreich, Silvio Micali, Shafi Goldwasser 

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

Recommendations

• Resettable statistical zero knowledge
• Resettably Secure Computation
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• scientific article; zbMATH DE number 2009952
• scientific article; zbMATH DE number 1722687

zbMATH Keywords

public-key cryptographyzero-knowledgesmart cardsidentification schemesconcurrent zero-knowledgewitness-indistinguisable proofs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (64)

• Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
• A direct PRF construction from Kolmogorov complexity
• New limits of provable security and applications to ElGamal encryption
• Resettable statistical zero-knowledge for NP
• An Extension to Bellare and Rogaway (1993) Model: Resetting Compromised Long-Term Keys
• Resumable zero-knowledge for circuits from symmetric key primitives
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
• Resettable statistical zero knowledge
• Title not available (Why is that?)
• Theory of Cryptography
• Title not available (Why is that?)
• Concurrent knowledge extraction in public-key models
• On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• Random walks and concurrent zero-knowledge
• Indistinguishable proofs of work or knowledge
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Efficient non-malleable commitment schemes
• Minicrypt primitives with algebraic structure and applications
• Resettably Secure Computation
• Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
• Smooth zero-knowledge hash functions
• Improved OR-composition of sigma-protocols
• Concurrent non-malleable commitments (and more) in 3 rounds
• Title not available (Why is that?)
• Leakproof secret sharing protocols with applications to group identification scheme
• Impossibility results for universal composability in public-key models and with fixed inputs
• Separating computational and statistical differential privacy in the client-server model
• On QA-NIZK in the BPK model
• Resettable cryptography in constant rounds -- the case of zero knowledge
• Simultaneously resettable arguments of knowledge
• On subversion-resistant SNARKs
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Nearly simultaneously resettable black-box zero knowledge
• (2+\(f\)(\(n\)))-SAT and its properties.
• Handling expected polynomial-time strategies in simulation-based security proofs
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• Pseudorandom functions: three decades later
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Adaptive hardness and composable security in the plain model from standard assumptions
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Unclonable Group Identification
• Resettable public-key encryption: how to encrypt on a virtual machine
• Online-Untransferable Signatures
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Concurrent zero knowledge, revisited
• Lower bounds for non-black-box zero knowledge
• On the necessary and sufficient assumptions for UC computation
• Weak Zero-Knowledge beyond the Black-Box Barrier
• On non-black-box simulation and the impossibility of approximate obfuscation
• On the impossibility of cryptography with tamperable randomness
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Individual simulations
• Post-quantum resettably-sound zero knowledge
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Pattern matching on encrypted streams
• Non-black-box simulation in the fully concurrent setting, revisited
• Non-interactive secure computation from one-way functions
• Co-sound Zero-Knowledge with Public Keys
• Efficient non-malleable commitment schemes
• Title not available (Why is that?)

This page was built for publication: Resettable zero-knowledge (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191990)