Paper 2019/990
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Sanjam Garg, Mohammad Hajiabadi, and Rafail Ostrovsky
Abstract
Substantial work on trapdoor functions (TDFs) has led to many powerful notions and applications. However, despite tremendous work and progress, all known constructions have prohibitively large public keys.
In this work, we introduce new techniques for realizing so-called range-trapdoor hash functions with short public keys. This notion, introduced by Döttling et al. [Crypto 2019], allows for encoding a range of indices into a public key in a way that the public key leaks no information about the range, yet an associated trapdoor enables recovery of the corresponding input part.
We give constructions of range-trapdoor hash functions, where for a range
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Trapdoor functionsrange trapdoor hashpower DDHrate-1 OTPrivate information retrieval
- Contact author(s)
- mdhajiabadi @ berkeley edu
- History
- 2019-09-27: revised
- 2019-09-02: received
- See all versions
- Short URL
- https://ia.cr/2019/990
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/990, author = {Sanjam Garg and Mohammad Hajiabadi and Rafail Ostrovsky}, title = {Efficient Range-Trapdoor Functions and Applications: Rate-1 {OT} and More}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/990}, year = {2019}, url = {https://eprint.iacr.org/2019/990} }