Book ChapterDOI
Relaxing IND-CCA: indistinguishability against chosen ciphertext verification attack
Sumit Kumar Pandey,Santanu Sarkar,Mahabir Prasad Jhanwar +2 more
- pp 63-76
TLDR
This article investigates the case where the oracle is restricted to only determine if the query made is a valid ciphertext or not, and points out that this seemingly weaker security model is meaningful, clear and useful to the extent where certain cryptographic functionalities can be achieved by ensuring the IND-CCVA security.Abstract:
The definition of IND-CCA security model for public key encryption allows an adversary to obtain (adaptively) decryption of ciphertexts of its choice. That is, the adversary is given oracle access to the decryption function corresponding to the decryption key in use. The adversary may make queries that do not correspond to a valid ciphertext, and the answer will be accordingly (i.e., a special "failure" symbol).
In this article, we investigate the case where we restrict the oracle to only determine if the query made is a valid ciphertext or not. That is, the oracle will output 1 if the query string is a valid ciphertext (do not output the corresponding plaintext) and output 0 otherwise. We call this oracle as "ciphertext verification oracle" and the corresponding security model as Indistinguishability against chosen ciphertext verification attack (IND-CCVA). We point out that this seemingly weaker security model is meaningful, clear and useful to the extent where we motivate that certain cryptographic functionalities can be achieved by ensuring the IND-CCVA security where as IND-CPA is not sufficient and IND-CCA provides more than necessary. We support our claim by providing nontrivial construction (existing/new) of:
· public key encryption schemes that are IND-CCVA secure but not IND-CCA secure,
· public key encryption schemes that are IND-CPA secure but not IND-CCVA secure.
· public key encryption schemes that are IND-CCA1 secure but not IND-CCVA secure.
Our discoveries are another manifestation of the subtleties that make the study of security notions for public key encryption schemes so attractive and are important towards achieving the definitional clarity of the target security.read more
Citations
More filters
Journal Article
Traitor Tracing with constant transmission rate
Aggelos Kiayias,Moti Yung +1 more
TL;DR: This work presents a general methodology and two protocol constructions that result in the first two public-key traitor tracing schemes with constant transmission rate in settings where plaintexts can be calibrated to be sufficientlylarge.
Book ChapterDOI
Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture
TL;DR: Non-trivial constructions of schemes are provided to resolve all the open issues and it is shown that any group homomorphic cryptosystem is CCA1.5 under some reasonable assumption, thereby providing another motivation for studying this particular type of attack scenario.
Proceedings ArticleDOI
A Quorum RFID System Using Threshold Cryptosystem
TL;DR: An RFID scheme that allows multi RFID tags to be authenticated within an RFID reader by using ElGamal cryptos system or the lite version of the Cramer-Shoup cryptosystem and elliptical curve cryptography is developed.
References
More filters
MonographDOI
Foundations of Cryptography
TL;DR: In this paper, the authors present a list of figures in the context of digital signatures and message authentication for general cryptographic protocols, including encryption, digital signatures, message authentication, and digital signatures.
Book
Foundations of Cryptography: Volume 2, Basic Applications
TL;DR: This second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols.
Book ChapterDOI
Polynomial reconstruction based cryptography
Aggelos Kiayias,Moti Yung +1 more
TL;DR: A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.
Book ChapterDOI
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
Ronald Cramer,Victor Shoup +1 more
TL;DR: In this paper, a new public key cryptosystem is proposed and analyzed, which is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. But the scheme is quite practical, and is not provable to be used in practice.