Resettable statistical zero-knowledge for NP
From MaRDI portal
Recommendations
- Resettable statistical zero knowledge
- Resettable zero-knowledge (extended abstract)
- Simultaneously resettable arguments of knowledge
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
Cites work
- 4-round resettably-sound zero knowledge
- A language-dependent cryptographic primitive
- A Pseudorandom Generator from any One-way Function
- Bit commitment using pseudorandomness
- Candidate witness encryption from lattice techniques
- Characterizing deterministic-prover zero knowledge
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
- Definitions and properties of zero-knowledge proof systems
- Foundations of Cryptography
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1842510 (Why is no real title available?)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
- Long-term security and universal composability
- Nearly simultaneously resettable black-box zero knowledge
- Non-black-box simulation from one-way functions and applications to resettable security
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the Composition of Public-Coin Zero-Knowledge Protocols
- On the impossibility of cryptography with tamperable randomness
- Post-quantum resettably-sound zero knowledge
- Predictable arguments of knowledge
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Resettable statistical zero knowledge
- Resettable zero-knowledge (extended abstract)
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Resettably-sound resettable zero knowledge in constant rounds
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Simultaneously resettable arguments of knowledge
- Statistical concurrent non-malleable zero knowledge
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
- Witness maps and applications
This page was built for publication: Resettable statistical zero-knowledge for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653049)
