Somewhere statistical soundness, post-quantum security, and SNARGs

DOI10.1007/978-3-030-90459-3_12MaRDI QIDQ2695640zbMATH OpenOpenAlexFDO

Authors Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_12

zbMATH Keywords

Fiat-Shamirpost-quantum securityKilianSNARGsstraight-line soundness

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Succinct arguments in the quantum random oracle model
• On the (In)security of Kilian-based SNARGs
• Lattice-based zero-knowledge SNARGs for arithmetic circuits
• Tight security bounds for Micali's SNARGs
• Subquadratic SNARGs in the random oracle model

Cites work

• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• Automata, Languages and Programming
• Cryptographic assumptions: a position paper
• Delegation for bounded space
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Fiat-Shamir: from practice to theory
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
• From obfuscation to the security of Fiat-Shamir for proofs
• How to delegate computations
• How to delegate computations publicly
• Information Security
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On the (In)security of Kilian-based SNARGs
• On the communication complexity of secure function evaluation with long output
• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Quantum proofs of knowledge
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• Spooky Encryption and Its Applications
• Succinct delegation for low-space non-deterministic computation
• Trapdoor hash functions and their applications

Cited in

(18)

• On the (In)security of Kilian-based SNARGs
• SNARGs for monotone policy batch NP
• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• New realizations of somewhere statistically binding hashing and positional accumulators
• Lattice-based functional commitments: fast verification and cryptanalysis
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Non-interactive zero-knowledge from non-interactive batch arguments
• Non-interactive publicly-verifiable delegation of committed programs
• Correlation intractability and SNARGs from sub-exponential DDH
• Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
• SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
• Rate-1 fully local somewhere extractable hashing from DDH
• Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
• Probabilistically checkable arguments for all NP
• Strong batching for non-interactive statistical zero-knowledge
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• Boosting batch arguments and RAM delegation
• Verifiable private information retrieval

This page was built for publication: Somewhere statistical soundness, post-quantum security, and SNARGs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695640)