Robust non-interactive zero knowledge
From MaRDI portal
Recommendations
Cited in
(95)- Hybrid commitments and their applications to zero-knowledge proof systems
- Leakage-resilient ring signature schemes
- On constant-round concurrent non-malleable proof systems
- Leakage-resilient group signature: definitions and constructions
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Secure software leasing
- Abuse resistant law enforcement access systems
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Witness authenticating NIZKs and applications
- Another look at extraction and randomization of Groth's zk-SNARK
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Continuously non-malleable secret sharing for general access structures
- Dual-mode NIZKs from obfuscation
- Strong continuous non-malleable encoding schemes with tamper-detection
- Continuously non-malleable codes in the split-state model
- Post-challenge leakage in public-key encryption
- Leakage resilience from program obfuscation
- QANIZK for adversary-dependent languages and their applications
- Novel \(\Omega\)-protocols for NP
- On the exact round complexity of best-of-both-worlds multi-party computation
- MPC with synchronous security and asynchronous responsiveness
- Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Zero-Knowledge Accumulators and Set Algebra
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- scientific article; zbMATH DE number 6720551 (Why is no real title available?)
- Expedient Non-malleability Notions for Hash Functions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Perfect Non-interactive Zero Knowledge for NP
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Round-optimal password-based authenticated key exchange
- Noninteractive Zero-Knowledge
- Multikey fully homomorphic encryption and applications
- Non-Malleable Codes from Additive Combinatorics
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Tagged one-time signatures: tight security and optimal tag size
- Verifiable elections that scale for free
- The bottleneck complexity of secure multiparty computation
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- A unified framework for non-universal SNARKs
- Cryptography and cryptographic protocols
- Strongly simulation-extractable leakage-resilient NIZK
- New techniques for noninteractive zero-knowledge
- Completely Non-malleable Encryption Revisited
- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
- Multi-theorem preprocessing NIZKs from lattices
- Witness-succinct universally-composable SNARKs
- Privacy-preserving blueprints
- Triply adaptive UC NIZK
- Updatable NIZKs from non-interactive zaps
- Universally composable -protocols in the global random-oracle model
- Practical non-malleable codes from symmetric-key primitives in 2-split-state model
- Non-malleable codes from leakage resilient cryptographic primitives
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- On structure-preserving cryptography and lattices
- Witness semantic security
- Towards permissionless consensus in the standard model via fine-grained complexity
- Public-key anamorphism in (CCA-secure) public-key encryption and beyond
- Round-optimal, fully secure distributed key generation
- Threshold encryption with silent setup
- Amplification of non-interactive zero knowledge, revisited
- Universally composable SNARKs with transparent setup without programmable random oracle
- Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy
- SNARKs for virtual machines are non-malleable
- Multi-authority registered attribute-based encryption
- Monotone-policy BARGs and more from BARGs and quadratic residuosity
- 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
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- zkSNARKs in the ROM with unconditional UC-security
- Distributing keys and random secrets with constant complexity
- Non-malleable subvector commitments
- Unclonable non-interactive zero-knowledge
- Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
- Non-interactive zero-knowledge arguments with certified deletion
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Simultaneous-message and succinct secure computation: reusable and multiparty protocols
- Distributed monotone-policy encryption for DNFs from lattices
- On quantum simulation-soundness
- The art of linearization: from a KZG's trick to a general commitment framework
- On the simulation-extractability of proof-carrying data
- Cryptography in the multi-string model
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
This page was built for publication: Robust non-interactive zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783745)
