Reusable online-efficient commitments

DOI10.1007/978-3-031-68397-8_1MaRDI QIDQ6653022

Nir Bitansky, Author name not available (Why is that?), Omer Paneth

Publication date: 13 December 2024

zbMATH Keywords

streaming delegation schemesuccinct locally-openable commitment

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Can we access a database both locally and privately?
• Towards doubly efficient private information retrieval
• Fast Polynomial Factorization and Modular Composition
• Universal Arguments and their Applications
• Pseudorandomness of ring-LWE for any ring and modulus
• How to Delegate Computations: The Power of No-Signaling Proofs
• Memory Delegation
• Multi-collision resistance: a paradigm for keyless hash functions
• On Ideal Lattices and Learning with Errors over Rings
• Classical hardness of learning with errors
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE

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)