The following pages link to Noninteractive Zero-Knowledge (Q3985810):
Displaying 50 items.
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Relativized perfect zero knowledge is not BPP (Q811120) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\) (Q1009514) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- Round-optimal perfect zero-knowledge proofs (Q1322120) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- A general zero-knowledge scheme (Q1364207) (← links)
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions (Q1382146) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Trading help for interaction in statistical zero-knowledge proofs (Q1402366) (← links)
- Short non-interactive cryptographic proofs (Q1590362) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Zero-knowledge arguments and public-key cryptography (Q1898111) (← links)
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation (Q1924194) (← links)
- Learning secrets interactively. Dynamic modeling in inductive inference (Q1932174) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Certificateless threshold cryptosystem secure against chosen-ciphertext attack (Q2465333) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs (Q3210163) (← links)
- Demonstrating possession without revealing factors and its application (Q3210172) (← links)
- An Introduction to the Use of zk-SNARKs in Blockchains (Q3294800) (← links)
- Impossibility of Black-Box Simulation Against Leakage Attacks (Q3457063) (← links)
- Dynamic Modeling in Inductive Inference (Q3529937) (← links)
- Anonymous Proxy Signatures (Q3540046) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol (Q3625953) (← links)
- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures (Q3631371) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Minimum-Knowledge Interactive Proofs for Decision Problems (Q3835409) (← links)
