Reusable online-efficient commitments

DOI10.1007/978-3-031-68397-8_1MaRDI QIDQ6653022zbMATH OpenFDO

Authors Nir Bitansky, Omer Paneth

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68397-8_1

zbMATH Keywords

streaming delegation schemesuccinct locally-openable commitment

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Doubly efficient cryptography: commitments, arguments and RAM MPC
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Additively homomorphic UC commitments with optimal amortized overhead
• Non-interactive and re-usable universally composable string commitments with adaptive security
• More efficient commitments from structured lattice assumptions

Cites work

• Can we access a database both locally and privately?
• Classical hardness of learning with errors
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Fast polynomial factorization and modular composition
• How to Delegate Computations: The Power of No-Signaling Proofs
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• scientific article; zbMATH DE number 2086729 (Why is no real title available?)
• scientific article; zbMATH DE number 742944 (Why is no real title available?)
• Memory delegation
• Multi-collision resistance: a paradigm for keyless hash functions
• On ideal lattices and learning with errors over rings
• Pseudorandomness of ring-LWE for any ring and modulus
• Towards doubly efficient private information retrieval
• Universal Arguments and their Applications

Cited in

(1)

• Doubly efficient cryptography: commitments, arguments and RAM MPC

This page was built for publication: Reusable online-efficient commitments

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