Short Pairing-Based Non-interactive Zero-Knowledge Arguments
From MaRDI portal
Publication:3058664
DOI10.1007/978-3-642-17373-8_19zbMath1253.94049OpenAlexW1538440442MaRDI QIDQ3058664
Publication date: 7 December 2010
Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_19
pairing-based cryptographycomputational power Diffie-Hellman assumptionpower knowledge of exponent assumptionsub-linear-size non-interactive zero-knowledge arguments
Related Items
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Subquadratic SNARGs in the random oracle model ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ On QA-NIZK in the BPK Model ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Arguments of Proximity ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Interactive Oracle Proofs ⋮ Delegating RAM Computations ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ Asymptotically quasi-optimal cryptography ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ A Unified Framework for Non-universal SNARKs ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Refereed delegation of computation ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ A survey of elliptic curves for proof systems ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ NIZK from SNARGs ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Succinct arguments for RAM programs via projection codes ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Snarky ceremonies ⋮ Lower bound on SNARGs in the random oracle model ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ The hunting of the SNARK ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Unnamed Item ⋮ On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups ⋮ Shorter arithmetization of nondeterministic computations ⋮ Election control through social influence with unknown preferences ⋮ No-signaling linear PCPs ⋮ How to build time-lock encryption ⋮ No-signaling linear PCPs ⋮ On subversion-resistant SNARKs ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Public verifiable private decision tree prediction ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Verifiable registration-based encryption ⋮ On succinct arguments and witness encryption from groups ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Succinct non-interactive secure computation
