How to prove statements obliviously?
From MaRDI portal
Publication:6660309
DOI10.1007/978-3-031-68403-6_14MaRDI QIDQ6660309
Aarushi Goel, Sanjam Garg, Mingyuan Wang
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure distributed key generation for discrete-log based cryptosystems
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- The hunting of the SNARK
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Compact multi-signatures for smaller blockchains
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Boosting verifiable computation on encrypted data
- Flexible and efficient verifiable computation on encrypted data
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- MuSig2: simple two-round Schnorr multi-signatures
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Simple Schnorr multi-signatures with applications to bitcoin
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Leveled Fully Homomorphic Signatures from Standard Lattices
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- How to share a secret
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive Oracle Proofs
- Structure-Preserving Signatures and Commitments to Group Elements
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fully homomorphic encryption using ideal lattices
- Verifiable Delegation of Computation over Large Datasets
- Fiat-Shamir: from practice to theory
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- On lattices, learning with errors, random linear codes, and cryptography
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Proofs for inner pairing products and applications
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Elliptic curve fast Fourier transform (ECFFT). I: Low-degree extension in time \(O(n \log n)\) over all finite fields
- Weighted secret sharing from wiretap channels
This page was built for publication: How to prove statements obliviously?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660309)
