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

Please wait, while we are loading the content...

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

Content Provider	Springer Nature Link
Author	Brakerski, Zvika Segev, Gil
Copyright Year	2013
Abstract	Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenarios where the latter exhibits inherent drawbacks. A deterministic encryption algorithm, however, cannot satisfy any meaningful notion of security when the plaintext is distributed over a small set. Bellare et al. addressed this difficulty by requiring semantic security to hold only when the plaintext has high min-entropy from the adversary’s point of view.In many applications, however, an adversary may obtain auxiliary information that is related to the plaintext. Specifically, when deterministic encryption is used as a building block of a larger system, it is rather likely that plaintexts do not have high min-entropy from the adversary’s point of view. In such cases, the framework of Bellare et al. might fall short from providing robust security guarantees.We formalize a framework for studying the security of deterministic public-key encryption schemes with respect to auxiliary inputs. Given the trivial requirement that the plaintext should not be efficiently recoverable from the auxiliary input, we focus on hard-to-invert auxiliary inputs. Within this framework, we propose two schemes: the first is based on the d-linear assumption for any d≥1 (including, in particular, the decisional Diffie–Hellman assumption), and the second is based on a rather general class of subgroup indistinguishability assumptions (including, in particular, the quadratic residuosity assumption and Paillier’s composite residuosity assumption). Our schemes are secure with respect to any auxiliary input that is subexponentially hard to invert (assuming the standard hardness of the underlying computational assumptions).In addition, our first scheme is secure even in the multi-user setting where related plaintexts may be encrypted under multiple public keys. Constructing a scheme that is secure in the multi-user setting (even without considering auxiliary inputs) was identified by Bellare et al. as an important open problem.
Starting Page	210
Ending Page	247
Page Count	38
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	27
Issue Number	2
e-ISSN	14321378
Language	English
Publisher	Springer US
Publisher Date	2013-01-11
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Public-key encryption deterministic encryption auxiliary inputs composable 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

Security Models and Proof Strategies for Plaintext-Aware Encryption

Practical Chosen Ciphertext Secure Encryption from Factoring

Discrete Logarithm Problems with Auxiliary Inputs

Characterization of Security Notions for Probabilistic Private-Key Encryption

A Forward-Secure Public-Key Encryption Scheme

Better security for deterministic public-key encryption: The auxiliary-input setting (2011)

Better security for deterministic public-key encryption: The auxiliary-input setting

Two-Key Triple Encryption

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

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

Similar Documents

Security Models and Proof Strategies for Plaintext-Aware Encryption

Practical Chosen Ciphertext Secure Encryption from Factoring

Discrete Logarithm Problems with Auxiliary Inputs

Characterization of Security Notions for Probabilistic Private-Key Encryption

A Forward-Secure Public-Key Encryption Scheme

Better security for deterministic public-key encryption: The auxiliary-input setting (2011)

Better security for deterministic public-key encryption: The auxiliary-input setting

Two-Key Triple Encryption

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

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