Noninteractive Zero-Knowledge
From MaRDI portal
Recommendations
- Theory of Cryptography
- scientific article; zbMATH DE number 4053065
- scientific article; zbMATH DE number 1842511
- Randomness-efficient non-interactive zero knowledge
- Non-interactive zero-knowledge proofs with fine-grained security
- New techniques for noninteractive zero-knowledge
- scientific article; zbMATH DE number 4197461
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Perfect Non-interactive Zero Knowledge for NP
Cited in
(only showing first 100 items - show all)- Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
- Hybrid commitments and their applications to zero-knowledge proof systems
- A uniform-complexity treatment of encryption and zero-knowledge
- Round-optimal perfect zero-knowledge proofs
- The knowledge complexity of quadratic residuosity languages
- A general zero-knowledge scheme
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Trading help for interaction in statistical zero-knowledge proofs
- Short non-interactive cryptographic proofs
- Certifying trapdoor permutations, revisited
- Scalable zero knowledge via cycles of elliptic curves
- Zero-knowledge arguments and public-key cryptography
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Learning secrets interactively. Dynamic modeling in inductive inference
- Non-interactive zero knowledge from sub-exponential DDH
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Fully homomorphic NIZK and NIWI proofs
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Computing on authenticated data
- Mercurial commitments with applications to zero-knowledge sets
- Enhancements of trapdoor permutations
- Certificateless threshold cryptosystem secure against chosen-ciphertext attack
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- Reduction zero-knowledge
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
- scientific article; zbMATH DE number 1583796 (Why is no real title available?)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Interactive proofs under continual memory leakage
- Short discreet proofs
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Short non-interactive zero-knowledge proofs
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- scientific article; zbMATH DE number 4180787 (Why is no real title available?)
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- Demonstrating possession without revealing factors and its application
- An introduction to the use of zk-SNARKs in blockchains
- Impossibility of black-box simulation against leakage attacks
- Dynamic Modeling in Inductive Inference
- Anonymous Proxy Signatures
- Perfect Non-interactive Zero Knowledge for NP
- Lower Bounds for Non-interactive Zero-Knowledge
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol
- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures
- Zero-Knowledge Simulation of Boolean Circuits
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- Round-optimal password-based authenticated key exchange
- scientific article; zbMATH DE number 4087662 (Why is no real title available?)
- The Knowledge Complexity of Interactive Proof Systems
- Minimum-Knowledge Interactive Proofs for Decision Problems
- scientific article; zbMATH DE number 94166 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 177022 (Why is no real title available?)
- Broadcast Interactive Proofs
- Removing Interaction from Zero-Knowledge Proofs
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
- Interactive Proofs with Provable Security against Honest Verifiers
- How to Utilize the Randomness of Zero-Knowledge Proofs
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 708824 (Why is no real title available?)
- scientific article; zbMATH DE number 1024046 (Why is no real title available?)
- scientific article; zbMATH DE number 1024047 (Why is no real title available?)
- scientific article; zbMATH DE number 1024095 (Why is no real title available?)
- The knowledge complexity of interactive proof-systems
- scientific article; zbMATH DE number 1759323 (Why is no real title available?)
- Randomness-efficient non-interactive zero knowledge
- Secure and efficient off-line digital money (extended abstract)
- Cryptography using \texttt{CAPTCHA} puzzles
- scientific article; zbMATH DE number 1405650 (Why is no real title available?)
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Super-Perfect Zero-Knowledge Proofs
- Cryptography and cryptographic protocols
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Mathematical Foundations of Computer Science 2004
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
- Non-interactive Proofs for Integer Multiplication
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Zero-Knowledge Sets with Short Proofs
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- Security in Communication Networks
- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
- Information Security and Cryptology
- Information Security and Cryptology
This page was built for publication: Noninteractive Zero-Knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985810)
