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