Filters








882 Hits in 2.9 sec

Bounded CCA2-Secure Encryption [chapter]

Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
Advances in Cryptology – ASIACRYPT 2007  
-For any polynomial q, a (non-black box) construction of q-bounded NM-CCA2-secure encryption schemes, from any IND-CPA-secure encryption scheme.  ...  Bounded-CCA2 non-malleability is the strongest notion of security yet known to be achievable assuming only the existence of IND-CPA secure encryption schemes.  ...  Bounded CCA2 Semantic Security.  ... 
doi:10.1007/978-3-540-76900-2_31 dblp:conf/asiacrypt/CramerHHIKPSV07 fatcat:pvgm3gre2vhd7mgdg2a5ke7g4i

GEM: A Generic Chosen-Ciphertext Secure Encryption Method [chapter]

Coron Jean-Sébastien, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen
2002 Lecture Notes in Computer Science  
This paper proposes an efficient and provably secure transform to encrypt a message with any asymmetric one-way cryptosystem.  ...  The resulting scheme achieves adaptive chosen-ciphertext security in the random oracle model.  ...  In contrast, for our converted encryption scheme we require the highest security level, namely IND-CCA2 security.  ... 
doi:10.1007/3-540-45760-7_18 fatcat:6aeu2wbfhzenpmxaessrtmfdcm

An efficient and provably secure public key encryption scheme based on coding theory

Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin Sherman Shen
2010 Security and Communication Networks  
To tackle this challenging issue, in this paper, we first propose an efficient IND-CCA2-secure public key encryption scheme based on coding theory.  ...  semantic security against adaptive chosen ciphertext attacks (IND-CCA2).  ...  In this paper, we propose an efficient IND-CCA2 secure public key encryption scheme based on coding theory.  ... 
doi:10.1002/sec.274 fatcat:rsxuueiwezeu3pjrh73lgnuyoi

Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages [chapter]

Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen
2002 Lecture Notes in Computer Science  
We put forward two generic constructions, gem-1 and gem-2 which apply to explicit fixed-length weakly secure primitives and provide a strongly secure (IND-CCA2) public-key encryption scheme for messages  ...  scheme presenting such a weak level of security as being OW-PCA (see further), to provide a cryptosystem of strongest level IND-CCA2 in the random oracle model.  ...  This level is now considered as standard and referred to as IND-CCA2 security or chosen-ciphertext security.  ... 
doi:10.1007/3-540-45664-3_2 fatcat:7zgm7g4xivfyfjkx53e5t6qgxu

RSA-TBOS signcryption with proxy re-encryption

Varad Kirtane, C. Pandu Rangan
2008 Proceedings of the 8th ACM workshop on Digital rights management - DRM '08  
We also introduce and define a new security notion of Weak-IND-CCA2, a slightly weakened adaptation of the IND-CCA2 security model for signcryption schemes and prove that RSA-TBOS-PRE is secure in this  ...  Our scheme is Weak-IND-CCA2 secure, unidirectional, extensible to multi-use and does not use bilinear maps.  ...  Recall that our scheme merely requires an IND-CCA2 secure encryption scheme for encryption of the second component of the ReKey.  ... 
doi:10.1145/1456520.1456531 dblp:conf/drm/KirtaneR08 fatcat:iziaoirr5rcxxlrfqgfd4zycja

Plaintext Simulatability

E. FUJISAKI
2006 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
It is known that PA implies the class of CCA2-secure encryption (denoted IND-CCA2) but not vice versa.  ...  Plaintext-simulatability, Plaintext-awareness, Chosen-ciphertext security (CCA2-security), Dolev-Dwork-Naor's encryption scheme, CCA2-secure encryption scheme without overhead. Key generation.  ...  encryption schemes such as the one proposed by Shoup [21] where the underlying symmetric encryption scheme is IND-CCA2 (in the symmetric encryption setting).  ... 
doi:10.1093/ietfec/e89-a.1.55 fatcat:hcbi5np7ejgwtmvpveaoilepsu

A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
2017 Journal of Cryptology  
Our construction also extends readily to guarantee nonmalleability under a bounded-CCA2 attack, thereby simultaneously improving on both results in the work of Cramer et al. (Asiacrypt '07).  ...  We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasi-linear blow-up in the size of the ciphertext.  ...  stronger security notion than indistinguishability under a bounded CCA2 attack (IND-q-CCA1); that is, every NM-q-CCA2 secure encryption is also IND-q-CCA2 secure, but the converse is not necessarily true  ... 
doi:10.1007/s00145-017-9254-z fatcat:bkvf747hdvauln3sjcqnq4yde4

A New Randomness Extraction Paradigm for Hybrid Encryption [chapter]

Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung
2009 Lecture Notes in Computer Science  
We present a new approach to the design of IND-CCA2 secure hybrid encryption schemes in the standard model.  ...  Indistinguishability against chosen-ciphertext attack (IND-CCA2 security) is by now the accepted standard security definition for public-key encryption schemes.  ...  Combining the latter universal 2 HPS with an AE-OT secure symmetric cipher gives an IND-CCA2 secure hybrid encryption scheme.  ... 
doi:10.1007/978-3-642-01001-9_34 fatcat:e2i3rcpmh5hr5prxw4uedzdl2e

Encrypted Secret Sharing and Analysis by Plaintext Randomization [chapter]

Stephen R. Tate, Roopa Vishwanathan, Scott Weeks
2015 Lecture Notes in Computer Science  
While intuition tells us that the secret should be protected if the PKE is secure against chosen-ciphertext attacks (i.e., CCA-secure), formally proving this reveals some subtle and non-trivial challenges  ...  In this paper we consider the problem of secret sharing where shares are encrypted using a public-key encryption (PKE) scheme and ciphertexts are publicly available.  ...  For Cramer-Shoup encryption scheme CS, we can bound Adv A,ESS CS ≤ 2q e Adv PK-CCA2 CS (t ′ , q d ) .  ... 
doi:10.1007/978-3-319-27659-5_4 fatcat:lspm5wleyrabbisuv4phhi7hva

Bit Encryption Is Complete

Steven Myers, Abhi Shelat
2009 2009 50th Annual IEEE Symposium on Foundations of Computer Science  
CCA2 security.  ...  Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, however, under a CCA2 attack.  ...  CCA2 secure encryption system.  ... 
doi:10.1109/focs.2009.65 dblp:conf/focs/MyersS09 fatcat:jd3owfpn65czbjwmyr2wsa36ja

Relations among notions of security for public-key encryption schemes [chapter]

Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway
1998 Lecture Notes in Computer Science  
We compare the relative strengths of popular notions of security for public-key encryption schemes.  ...  We similarly treat plaintext awareness, a notion of security in the randomoracle model.  ...  Acknowledgments Following an oral presentation of an earlier version of this paper, Moni Naor suggested that we present notions of security in a manner that treats the goal and the attack model orthogonally  ... 
doi:10.1007/bfb0055718 fatcat:mkbskullcvetva7enk5auice3m

Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries [chapter]

Pascal Paillier, David Pointcheval
1999 Lecture Notes in Computer Science  
Inspired from a recently discovered trapdoor technique based on composite-degree residues, our converted encryption schemes are proven, in the random oracle model, secure against active adversaries (NM-CCA2  ...  This paper proposes two new public-key cryptosystems semantically secure against adaptive chosen-ciphertext attacks.  ...  More recently, Fujisaki and Okamoto [10] discovered a generic conversion method which transforms any semantically secure encryption scheme into a scheme secure in the sense of NM-CCA2 in the random oracle  ... 
doi:10.1007/978-3-540-48000-6_14 fatcat:tjjcyqmjp5ev7losk62imesqmq

Timed-Release and Key-Insulated Public Key Encryption [chapter]

Jung Hee Cheon, Nicholas Hopper, Yongdae Kim, Ivan Osipkov
2006 Lecture Notes in Computer Science  
In this paper we consider two security notions related to Identity Based Encryption: Key-insulated public key encryption, introduced by Dodis, Katz, Xu and Yung; and Timed-Release Public Key cryptography  ...  We first formalize the notion of secure timed-release public key encryption, and show that, despite several differences in its formulation, it is equivalent to strongly key-insulated public key encryption  ...  Acknowledgements The authors thank Moti Yung for the excellent suggestion to bridge the link between timed-release and key-insulated encryption and many other invaluable comments, and the anonymous reviewers  ... 
doi:10.1007/11889663_17 fatcat:tkqg4muhnnactjvstwlbbowdzy

Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks [chapter]

Takahiro Matsuda, Kanta Matsuura
2011 Lecture Notes in Computer Science  
Whether it is possible to construct a chosen ciphertext secure (CCA secure) public key encryption (PKE) scheme only from a chosen plaintext secure (CPA secure) one is a fundamental open problem, and the  ...  best known positive results regarding this problem are the constructions of so-called bounded CCA secure schemes.  ...  These previous results show that we can achieve the best possible security notion (NM-q-CCA2) in the bounded CCA framework.  ... 
doi:10.1007/978-3-642-19379-8_15 fatcat:blnu37kh7zglxpreunmm7i5ys4

On the Security Notions for Public-Key Encryption Schemes [chapter]

Duong Hieu Phan, David Pointcheval
2005 Lecture Notes in Computer Science  
Excepted the trivial implications, all the other relations are strict gaps, with no polynomial reduction (under the assumption that IND-CCA2 secure encryption schemes exist.)  ...  In this paper, we revisit the security notions for public-key encryption, and namely indistinguishability.  ...  CPA, CCA1, CCA2, or (i, j)-CCA, the advantage of A is bounded by ε.  ... 
doi:10.1007/978-3-540-30598-9_3 fatcat:rwoqz7tvajfklnpamxswx3w54a
« Previous Showing results 1 — 15 out of 882 results