Functional commitments for all functions, with transparent setup and from SIS

DOI10.1007/978-3-031-30620-4_10zbMath1528.94043OpenAlexW4365807618MaRDI QIDQ6063522

Chris Peikert, Leo de Castro

Publication date: 12 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_10

zbMATH Keywords

functional commitment scheme for nonlinear functionsshort integer solution lattice problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

\textsf{Orbweaver}: succinct linear functional commitments from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Transparent SNARKs from DARK compilers
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Succinct functional commitment for a large class of arithmetic circuits
• KVaC: key-value commitments for blockchains and beyond
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Vector and functional commitments from lattices
• FHE Circuit Privacy Almost for Free
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Lattice-based FHE as secure as PKE
• Constant-Size Commitments to Polynomials and Their Applications
• Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
• Predicate Encryption for Circuits from LWE
• Trapdoors for hard lattices and new cryptographic constructions
• Generalized Compact Knapsacks Are Collision Resistant
• A Depth-Universal Circuit
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Signatures of Correct Computation
• Vector Commitments and Their Applications
• Streaming Authenticated Data Structures
• Verifiable Delegation of Computation over Large Datasets
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Updatable Zero-Knowledge Databases
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• Additive-homomorphic functional commitments and applications to homomorphic signatures

This page was built for publication: Functional commitments for all functions, with transparent setup and from SIS