NDLI: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

Content Provider	Springer Nature Link
Author	Fuller, Benjamin O’Neill, Adam Reyzin, Leonid
Copyright Year	2013
Abstract	This paper addresses deterministic public-key encryption schemes (DE), which are designed to provide meaningful security when only source of randomness in the encryption process comes from the message itself. We propose a general construction of DE that unifies prior work and gives novel schemes. Specifically, its instantiations include: The first construction from any trapdoor function that has sufficiently many hardcore bits. The first construction that provides “bounded” multi-message security (assuming lossy trapdoor functions). The security proofs for these schemes are enabled by three tools that are of broader interest: A weaker and more precise sufficient condition for semantic security on a high-entropy message distribution. Namely, we show that to establish semantic security on a distribution M of messages, it suffices to establish indistinguishability for all conditional distribution M\|E, where E is an event of probability at least 1/4. (Prior work required indistinguishability on all distributions of a given entropy.) A result about computational entropy of conditional distributions. Namely, we show that conditioning on an event E of probability p reduces the quality of computational entropy by a factor of p and its quantity by log21/p. A generalization of leftover hash lemma to correlated distributions. We also extend our result about computational entropy to the average case, which is useful in reasoning about leakage-resilient cryptography: leaking λ bits of information reduces the quality of computational entropy by a factor of 2 λ and its quantity by λ.
Starting Page	671
Ending Page	717
Page Count	47
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	28
Issue Number	3
e-ISSN	14321378
Language	English
Publisher	Springer US
Publisher Date	2013-12-13
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Deterministic encryption Trapdoor functions Hardcore functions Computational entropy Information leakage q-Bounded security Coding and Information Theory Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A unified approach to deterministic encryption: New constructions and a connection to computational entropy (2012)

A unified approach to deterministic encryption: New constructions and a connection to computational entropy (2012)

L.: a unified approach to deterministic encryption: new constructions and a connection to computational entropy. Cryptology eprint archive (2012).

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting

Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

Security Models and Proof Strategies for Plaintext-Aware Encryption

Paillier's Trapdoor Function Hides up to O(n) Bits

A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

Similar Documents

A unified approach to deterministic encryption: New constructions and a connection to computational entropy (2012)

A unified approach to deterministic encryption: New constructions and a connection to computational entropy (2012)

L.: a unified approach to deterministic encryption: new constructions and a connection to computational entropy. Cryptology eprint archive (2012).

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting

Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

Security Models and Proof Strategies for Plaintext-Aware Encryption

Paillier's Trapdoor Function Hides up to O(n) Bits

A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy