Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
From MaRDI portal
Publication:6104342
Recommendations
- Non-interactive batch arguments for NP from standard assumptions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- The Uber-Assumption Family
- Efficient noninteractive proof systems for bilinear groups
- Parallel complexity for nilpotent groups
- scientific article; zbMATH DE number 919272
- scientific article; zbMATH DE number 4072970
- \(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
- scientific article; zbMATH DE number 96386
- scientific article; zbMATH DE number 2014436
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Algebraic methods for interactive proof systems
- Batch verification and proofs of proximity with polylog overhead
- Constant-round interactive proofs for delegating computation
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Delegation for bounded space
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fiat-Shamir: from practice to theory
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- How to delegate computations
- How to delegate computations publicly
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1136108 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- New realizations of somewhere statistically binding hashing and positional accumulators
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the communication complexity of secure function evaluation with long output
- On the existence of extractable one-way functions
- On the size of pairing-based non-interactive arguments
- Perfect Non-interactive Zero Knowledge for NP
- Programmable hash functions in the multilinear setting
- Public Key Cryptography - PKC 2006
- Quadratic span programs and succinct NIZKs without PCPs
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Secure two-party computation with low communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Short pairing-based non-interactive zero-knowledge arguments
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Synchronized aggregate signatures from the RSA assumption
- The hunting of the SNARK
- Theory of Cryptography
- Universal signature aggregators
- Vector commitments and their applications
Cited in
(50)- Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Registered attribute-based encryption
- Non-interactive universal arguments
- SNARGs for monotone policy batch NP
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive zero-knowledge from non-interactive batch arguments
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
- Sequential half-aggregation of lattice-based signatures
- On black-box knowledge-sound commit-and-prove SNARKs
- A simple and efficient framework of proof systems for NP
- Locally verifiable distributed SNARGs
- On black-box verifiable outsourcing
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Rate-1 fully local somewhere extractable hashing from DDH
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Monotone-policy aggregate signatures
- Strong batching for non-interactive statistical zero-knowledge
- Aggregating Falcon signatures with LaBRADOR
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Adaptive security in SNARGs via iO and lossy functions
- Incrementally verifiable computation for NP from standard assumptions
- Rate-1 statistical non-interactive zero-knowledge
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Sometimes-decryptable homomorphic encryption from sub-exponential DDH
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- T-Spoon: tightly secure two-round multi-signatures with key aggregation
- Tightly secure lattice-based synchronized aggregate signature in standard model
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Chosen ciphertext security via BARGs
- Monotone-policy BARGs and more from BARGs and quadratic residuosity
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Homomorphic secret sharing with verifiable evaluation
- Key-homomorphic and aggregate verifiable random functions
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- Succinct witness encryption for batch languages and applications
- On succinct non-interactive secure computation with malicious security
- Hash-based multi-signatures for post-quantum Ethereum
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- Simple attacks against (extended) Fiat-Shamir
- Attribute-based signatures for circuits with optimal parameter size from standard assumptions
This page was built for publication: Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104342)
