These public bookcases are true lifesavers.
Nils Fleischhacker
- 120 Followers
- 90 Following
- 113 Posts
Assistant Professor for Theoretical Cryptography at Ruhr University Bochum. Opinions probably someone else's. he/him
New paper! We construct an extractable witness encryption scheme for KZG commitments. This leads to a surprisingly efficient Laconic OT. https://ia.cr/2024/264
An extractable witness encryption scheme for KZG commitments allows to encrypt towards a triple (com,α,β) and you can decrypt iff you know an opening attesting that com is a commitment to a polynomial f with f(α)=β.
The Laconic OT derived from it has per OT computational costs in the single digit millisecond range for both sender and receiver, independent of the database size. The communication costs are just 256 Bytes.
The main downside is that for very large database sizes, the public parameters and the precomputation time become somewhat unwieldy.
I didn't know that anyone actually used SHA384. 🤔 (Also, it will always be amusing to me that they print the signature on the receipt in a format where verification would involve someone typing it back into a computer.)