Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
From MaRDI portal
Recommendations
Cited in
(90)- On the implausibility of constant-round public-coin zero-knowledge proofs
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- Classically verifiable NIZK for QMA with preprocessing
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- Reverse firewalls for adaptively secure MPC without setup
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Enhancements of trapdoor permutations
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- A simple and efficient framework of proof systems for NP
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Pairing-based non-interactive zero-knowledge proofs
- Zero-knowledge proofs of proximity
- 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
- Randomness-efficient non-interactive zero knowledge
- One-message zero knowledge and non-malleable commitments
- Round optimal black-box ``commit-and-prove
- Interactive proofs under continual memory leakage
- Perfect Non-interactive Zero Knowledge for NP
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Compact NIZKs from standard assumptions on bilinear maps
- Cryptography and cryptographic protocols
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive zero-knowledge functional proofs
- Triply adaptive UC NIZK
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- A Brief History of Provably-Secure Public-Key Encryption
- Long-term security and universal composability
- On server trust in private proxy auctions
- Hybrid commitments and their applications to zero-knowledge proof systems
- Separating computational and statistical differential privacy in the client-server model
- Explainable arguments
- Simple and generic constructions of succinct functional encryption
- Cryptography in the multi-string model
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Secure multiparty RAM computation in constant rounds
- An exponential separation between MA and AM proofs of proximity
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Lower Bounds for Non-interactive Zero-Knowledge
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- On the Power of Secure Two-Party Computation
- Cryptography with One-Way Communication
- 3-message zero knowledge against human ignorance
- scientific article; zbMATH DE number 1670843 (Why is no real title available?)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Non-malleable commitments against quantum attacks
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Compact NIZKs from standard assumptions on bilinear maps
- How to extract useful randomness from unreliable sources
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Statistical ZAPR arguments from bilinear maps
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Towards accountability in CRS generation
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Multi-theorem designated-verifier NIZK for QMA
- Ring signatures: Stronger definitions, and constructions without random oracles
- Leakage-tolerant circuits
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Non-interactive zero-knowledge proofs for composite statements
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On non-black-box simulation and the impossibility of approximate obfuscation
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Non-interactive zero-knowledge proofs to multiple verifiers
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- Amplification of non-interactive zero knowledge, revisited
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Secure MPC: laziness leads to GOD
- On the power of secure two-party computation
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Mercurial commitments with applications to zero-knowledge sets
- Individual simulations
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Post-quantum resettably-sound zero knowledge
- Statistical ZAPs from group-based assumptions
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Resumable zero-knowledge for circuits from symmetric key primitives
- NIZK from SNARGs
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- On the existence of extractable one-way functions
- Round-optimal password-based authenticated key exchange
- Indistinguishability obfuscation: from approximate to exact
- Towards accountability in CRS generation
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Universally Composable Adaptive Priced Oblivious Transfer
This page was built for publication: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268869)
