A Proposal for an ISO Standard for Public Key Encryption

By Victor Shoup. 2001

443 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “Towards this end, we assume the existence of a publickey infrastructure and the basic cryptographic primitives (CCA-secure public-key encryption [43, 108, 109], digital signatures [71], etc.”
Introduction to Modern Cryptography, Second Edition (2014, unknown): “37 appears to have been introduced and first analyzed by Shoup [157].”
Relaxing Chosen-Ciphertext Security (2003, background): “The term “compatible relation” is adapted from [24] where it is defined without item 1(b).”
Public Key Broadcast Encryption for Stateless Receivers (2002, background): “Even though it seems hard to extend the Subset-Cover framework to achieve CCA2-security, it is possible to achieve a slightly relaxed (but essentially as useful) notion of gCCA2-security recently proposed by [20, 1].”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, background): “For this reason, we need to tolerate a harmless form of malleability (akin to those accepted as reasonable in [2, 20, 43 ]) of ciphertexts at level 1.”
On the Security of Joint Signature and Encryption (2002, background): “We remark that the notion of gCCA2 -security was recently proposed in [32] (under the name benign malleability ) for the ISO public key encryption standard.”
Modern Cryptography: Theory and Practice (2003, methodology): “Hybrid encryption schemes include several KEM-DEM schemes proposed by Shoup [271], a scheme named FO proposed by Fujisaki and Okamoto [113], a scheme named HD-RSA proposed by Pointcheval [232], a scheme named DHAES proposed by Abdalla, Bellare and Rogaway [4], a variation of the Cramer-Shoup scheme ”
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem (2004, unknown): “Workssuchas[8,9,14,19,11, 20 ]providedesignsofIND-CCA-secureasymmetricencryption”
Sequences of games: a tool for taming complexity in security proofs (2004, methodology): “The author has used proofs organized as sequences of games extensively in his own work [Sho00, SS00, Sho01 , Sho02, CS02, CS03b, CS03a, GS04] and has found them to be an indispensable tool — while some of the proofs in these papers could be structured dierently, it is hard to imagine how most of th”