Public-key encryption indistinguishable under plaintext-checkable attacks

@article{Abdalla2016PublickeyEI,
  title={Public-key encryption indistinguishable under plaintext-checkable attacks},
  author={Michel Abdalla and F. Benhamouda and D. Pointcheval},
  journal={IET Inf. Secur.},
  year={2016},
  volume={10},
  pages={288-303}
}
Indistinguishability under chosen-ciphertext attack (IND-CCA) is now considered the de facto security notion for public-key encryption. However, this sometimes offers a stronger security guarantee than what is needed. In this study, the authors consider a weaker security notion, termed as indistinguishability under plaintext-checking attacks (IND-PCA), in which the adversary has only access to an oracle indicating whether or not a given ciphertext encrypts a given message. After formalising… Expand
36 Citations
Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
  • 6
VTBPEKE: Verifier-based Two-Basis Password Exponential Key Exchange
  • 10
  • PDF
Verifier-based anonymous password-authenticated key exchange protocol in the standard model.
  • 2
  • PDF
Security of the J-PAKE Password-Authenticated Key Exchange Protocol
  • 53
  • PDF
Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World
  • 51
  • PDF
Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions
  • PDF
Hardware Security without Secure Hardware: How to Decrypt with a Password and a Server
  • Highly Influenced
  • PDF
On Password-Authenticated Key Exchange Security Modeling
  • PDF
Tightly Secure CCA-Secure Encryption without Pairings
  • 2
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 72 REFERENCES
New Security Results on Encrypted Key Exchange
  • 167
  • PDF
Simple Password-Based Encrypted Key Exchange Protocols
  • 282
  • PDF
Authenticated Key Exchange Secure against Dictionary Attacks
  • 1,363
  • PDF
Password Based Key Exchange with Mutual Authentication
  • 84
  • PDF
...
1
2
3
4
5
...