NDLI: Characterization of Security Notions for Probabilistic Private-Key Encryption

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

Characterization of Security Notions for Probabilistic Private-Key Encryption

Content Provider	Springer Nature Link
Author	Katz, Jonathan Yung, Moti
Copyright Year	2005
Abstract	The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending security notions from the public-key setting, we define security in the sense of both indistinguishability and non-malleability against chosen-plaintext and chosen-ciphertext attacks, considering both non-adaptive (i.e., ``lunchtime'') and adaptive oracle access (adaptive here refers to an adversary's ability to interact with a given oracle even after viewing the challenge ciphertext). We then characterize the 18 resulting security notions in two ways. First, we construct a complete hierarchy of security notions; that is, for every pair of definitions we show whether one definition is stronger than the other, whether the definitions are equivalent, or whether they are incomparable. Second, we partition these notions of security into two classes (computational or information-theoretic) depending on whether one-way functions are necessary in order for encryption schemes satisfying the definition to exist. Perhaps our most surprising result is that security against adaptive chosen-plaintext attack is (polynomially) equivalent to security against non-adaptive chosen-plaintext attack. On the other hand, the ability of an adversary to mount a (non-adaptive) chosen-plaintext attack is the key feature distinguishing computational and information-theoretic notions of security. These results hold for all security notions considered here.
Starting Page	67
Ending Page	95
Page Count	29
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	19
Issue Number	1
e-ISSN	14321378
Language	English
Publisher	Springer-Verlag
Publisher Date	2005-05-03
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks Coding and Information Theory
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

Two-Key Triple Encryption

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

Security Models and Proof Strategies for Plaintext-Aware Encryption

Practical Chosen Ciphertext Secure Encryption from Factoring

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm

A Forward-Secure Public-Key Encryption Scheme

A Software-Optimized Encryption Algorithm

Securely Obfuscating Re-Encryption

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Characterization of Security Notions for Probabilistic Private-Key Encryption

Similar Documents

Two-Key Triple Encryption

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

Security Models and Proof Strategies for Plaintext-Aware Encryption

Practical Chosen Ciphertext Secure Encryption from Factoring

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm

A Forward-Secure Public-Key Encryption Scheme

A Software-Optimized Encryption Algorithm

Securely Obfuscating Re-Encryption

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Characterization of Security Notions for Probabilistic Private-Key Encryption