TY - GEN
T1 - Reusable Online-Efficient Commitments
AU - Bitansky, Nir
AU - Paneth, Omer
AU - Shamir, Dana
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2024.
PY - 2024
Y1 - 2024
N2 - An online-efficient commitment is a succinct locally-openable commitment, where the bulk of the sender work is done offline, generating an encoding x~ of the committed data x. In the online phase, both the sender, given random access to x~, and receiver run in polylogarithmic time in the length of x. Online-efficient commitments were recently constructed under the standard assumption of RingLWE by Lin, Mook, and Wichs, but with a significant caveat: they are not reusable. Their commitments are privately verifiable and cease to be binding if a malicious sender can learn whether the receiver accepts or rejects in repeated decommitment requests. We construct the first reusable online-efficient commitment under a standard assumption, Ring LWE. A main component in our analysis is a leakage lemma by Chung, Kalai, Liu, and Raz (CRYPTO ‘11) introduced in the context of streaming delegation schemes.
AB - An online-efficient commitment is a succinct locally-openable commitment, where the bulk of the sender work is done offline, generating an encoding x~ of the committed data x. In the online phase, both the sender, given random access to x~, and receiver run in polylogarithmic time in the length of x. Online-efficient commitments were recently constructed under the standard assumption of RingLWE by Lin, Mook, and Wichs, but with a significant caveat: they are not reusable. Their commitments are privately verifiable and cease to be binding if a malicious sender can learn whether the receiver accepts or rejects in repeated decommitment requests. We construct the first reusable online-efficient commitment under a standard assumption, Ring LWE. A main component in our analysis is a leakage lemma by Chung, Kalai, Liu, and Raz (CRYPTO ‘11) introduced in the context of streaming delegation schemes.
UR - http://www.scopus.com/inward/record.url?scp=85202302841&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-68397-8_1
DO - 10.1007/978-3-031-68397-8_1
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85202302841
SN - 9783031683961
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 3
EP - 35
BT - Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings
A2 - Reyzin, Leonid
A2 - Stebila, Douglas
PB - Springer Science and Business Media Deutschland GmbH
T2 - 44th Annual International Cryptology Conference, CRYPTO 2024
Y2 - 18 August 2024 through 22 August 2024
ER -