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)- Round-optimal password-based authenticated key exchange
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Mathematical Foundations of Computer Science 2004
- Demonstrating possession without revealing factors and its application
- An introduction to the use of zk-SNARKs in blockchains
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Secure non-interactive reducibility is decidable
- The knowledge complexity of interactive proof-systems
- Information Security and Cryptology
- Anonymous Proxy Signatures
- Information Security and Cryptology
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- From one-time to two-round reusable multi-signatures without nested forking
- Doubly-efficient batch verification in statistical zero-knowledge
- Theory of Cryptography
- Enhancements of trapdoor permutations
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Broadcast Interactive Proofs
- The Knowledge Complexity of Interactive Proof Systems
- Trading help for interaction in statistical zero-knowledge proofs
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- Reduction zero-knowledge
- Removing Interaction from Zero-Knowledge Proofs
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- 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
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Computing on authenticated data
- Randomness-efficient non-interactive zero knowledge
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Interactive proofs under continual memory leakage
- A general zero-knowledge scheme
- Zero-Knowledge Sets with Short Proofs
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- Security in Communication Networks
- scientific article; zbMATH DE number 4180787 (Why is no real title available?)
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Perfect Non-interactive Zero Knowledge for NP
- scientific article; zbMATH DE number 4087662 (Why is no real title available?)
- Short discreet proofs
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- scientific article; zbMATH DE number 1583796 (Why is no real title available?)
- Round-optimal perfect zero-knowledge proofs
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- Zero-knowledge arguments and public-key cryptography
- Cryptography and cryptographic protocols
- scientific article; zbMATH DE number 1405650 (Why is no real title available?)
- scientific article; zbMATH DE number 177022 (Why is no real title available?)
- Short non-interactive cryptographic proofs
- Triply adaptive UC NIZK
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- On server trust in private proxy auctions
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Witness-succinct universally-composable SNARKs
- Cryptography using \texttt{CAPTCHA} puzzles
- Hybrid commitments and their applications to zero-knowledge proof systems
- Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
- Key-oblivious encryption from isogenies with application to accountable tracing signatures
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Cryptography in the multi-string model
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Zero-Knowledge Simulation of Boolean Circuits
- Minimum-Knowledge Interactive Proofs for Decision Problems
- scientific article; zbMATH DE number 708824 (Why is no real title available?)
- A uniform-complexity treatment of encryption and zero-knowledge
- Lower Bounds for Non-interactive Zero-Knowledge
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- Certifying trapdoor permutations, revisited
- Certificateless threshold cryptosystem secure against chosen-ciphertext attack
- The knowledge complexity of quadratic residuosity languages
- Beyond post-quantum cryptography: cryptosystems that are secure in certain computation models
- Learning secrets interactively. Dynamic modeling in inductive inference
- Spreading alerts quietly and the subgroup escape problem
- Impossibility of black-box simulation against leakage attacks
- Non-interactive zero knowledge from sub-exponential DDH
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Rate-1 statistical non-interactive zero-knowledge
- Multi-theorem preprocessing NIZKs from lattices
- Fully homomorphic NIZK and NIWI proofs
- Strong batching for non-interactive statistical zero-knowledge
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Dynamic Modeling in Inductive Inference
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- scientific article; zbMATH DE number 1759323 (Why is no real title available?)
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Super-Perfect Zero-Knowledge Proofs
- Scalable zero knowledge via cycles of elliptic curves
- scientific article; zbMATH DE number 94166 (Why is no real title available?)
- Secure and efficient off-line digital money (extended abstract)
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)
