Paper 2016/580
Fine-grained Cryptography
Akshay Degwekar, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan
Abstract
Fine-grained cryptographic primitives are ones that are secure against adversaries with a-priori bounded polynomial resources (time, space or parallel-time), where the honest algorithms use less resources than the adversaries they are designed to fool. Such primitives were previously studied in the context of time-bounded adversaries (Merkle, CACM 1978), space-bounded adversaries (Cachin and Maurer, CRYPTO 1997) and parallel-time-bounded adversaries (Håstad, IPL 1987). Our goal is to show unconditional security of these constructions when possible, or base security on widely believed separation of worst-case complexity classes. We show:
NC
Note: Full version.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in CRYPTO 2016
- Keywords
- Fine-grained CryptographyPublic Key CryptographyRandomized EncodingsAC0
- Contact author(s)
- akshayd @ mit edu
- History
- 2016-06-16: last of 2 revisions
- 2016-06-06: received
- See all versions
- Short URL
- https://ia.cr/2016/580
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/580, author = {Akshay Degwekar and Vinod Vaikuntanathan and Prashant Nalini Vasudevan}, title = {Fine-grained Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/580}, year = {2016}, url = {https://eprint.iacr.org/2016/580} }