Perfect Non-interactive Zero Knowledge for NP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722670 (Why is no real title available?)
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 2019634 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1405650 (Why is no real title available?)
- scientific article; zbMATH DE number 1418312 (Why is no real title available?)
- A complete problem for statistical zero knowledge
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Computational Complexity and Knowledge Complexity
- Minimum disclosure proofs of knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Non-interactive and reusable non-malleable commitment schemes
- Noninteractive Zero-Knowledge
- Nonmalleable Cryptography
- Perfect Non-interactive Zero Knowledge for NP
- Statistical zero-knowledge languages can be recognized in two rounds
- Theory of Cryptography
- Theory of Cryptography
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Universally composable two-party and multi-party secure computation
Cited in
(only showing first 100 items - show all)- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Black-box non-interactive zero knowledge from vector trapdoor hash
- Unique NIZKs and steganography detection
- New techniques for preimage sampling: improved NIZKs and more from LWE
- Laconic private set intersection and applications
- Fully leakage-resilient signatures
- Multikey fully homomorphic encryption and applications
- Generic Framework for Attribute-Based Group Signature
- Non-interactive zero-knowledge from LPN and MQ
- Homomorphic Encryption and Signatures from Vector Decomposition
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- A practical NIZK argument for confidential transactions over account-model blockchain
- Statistical ZAPs from group-based assumptions
- Two-round maliciously secure computation with super-polynomial simulation
- Resumable zero-knowledge for circuits from symmetric key primitives
- NIZK from SNARGs
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Non-interactive confirmer signatures
- Receiver selective opening security for identity-based encryption in the multi-challenge setting
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Co-sound Zero-Knowledge with Public Keys
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Auditable attribute-based credentials scheme and its application in contact tracing
- Information Security and Cryptology
- Non-interactive zero-knowledge proofs with fine-grained security
- Compact Group Signatures Without Random Oracles
- Perfect NIZK with Adaptive Soundness
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- Using abelian varieties to improve pairing-based cryptography
- Adaptively secure attribute-based encryption from witness encryption
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Towards witness encryption without multilinear maps
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- A simple and efficient framework of proof systems for NP
- Bicameral and auditably private signatures
- Threshold structure-preserving signatures
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- New Techniques for Non-interactive Shuffle and Range Arguments
- An improved affine equivalence algorithm for random permutations
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Algorithms and Computation
- Anonymous yet Traceable Strong Designated Verifier Signature
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Improving the efficiency of report and trace ring signatures
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Perfect Non-interactive Zero Knowledge for NP
- Identity-based quotable ring signature
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Improved OR-composition of sigma-protocols
- Equivocal Blind Signatures and Adaptive UC-Security
- Better two-round adaptive multi-party computation
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- A linkable ring signature scheme with unconditional anonymity in the standard model
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Universal ring signatures in the standard model
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- Non-interactive batch arguments for NP from standard assumptions
- Another look at extraction and randomization of Groth's zk-SNARK
- Sub-linear size traceable ring signatures without random oracles
- Triply adaptive UC NIZK
- QA-NIZK arguments of same opening for bilateral commitments
- Witness-succinct universally-composable SNARKs
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Signatures of knowledge for Boolean circuits under standard assumptions
- Explainable arguments
- Report and trace ring signatures
- Simplified Submission of Inputs to Protocols
- Non-interactive zero-knowledge from non-interactive batch arguments
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Universally composable password-hardened encryption
- On the limits of non-interactive blind signatures
- A hidden-bits approach to statistical ZAPs from LWE
- Universally composable succinct vector commitments and applications
- Multimodal private signatures
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- Efficient Traceable Signatures in the Standard Model
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Secure multiparty RAM computation in constant rounds
- Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
- A note on non-interactive zero-knowledge from CDH
- Correlation intractability and SNARGs from sub-exponential DDH
- On the impossibility of algebraic NIZK in pairing-free groups
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Certifying trapdoor permutations, revisited
This page was built for publication: Perfect Non-interactive Zero Knowledge for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593105)
