Reusable online-efficient commitments
From MaRDI portal
Publication:6653022
DOI10.1007/978-3-031-68397-8_1MaRDI QIDQ6653022FDOQ6653022
Authors: Nir Bitansky, Omer Paneth
Publication date: 13 December 2024
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
- Fast polynomial factorization and modular composition
- Universal Arguments and their Applications
- Classical hardness of learning with errors
- Title not available (Why is that?)
- On ideal lattices and learning with errors over rings
- Memory delegation
- Multi-collision resistance: a paradigm for keyless hash functions
- Pseudorandomness of ring-LWE for any ring and modulus
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Delegate Computations: The Power of No-Signaling Proofs
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
Cited In (1)
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)