Filters








1,827 Hits in 3.4 sec

Securing Threshold Cryptosystems against Chosen Ciphertext Attack

Victor Shoup, Rosario Gennaro
2002 Journal of Cryptology  
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement.  ...  The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the random oracle model.  ...  In this paper, we consider the problem of designing threshold cryptosystems that are secure against chosen ciphertext attack.  ... 
doi:10.1007/s00145-001-0020-9 fatcat:omddi4i2ujbh7b5ylcuxhryqs4

Securing threshold cryptosystems against chosen ciphertext attack [chapter]

Victor Shoup, Rosario Gennaro
1998 Lecture Notes in Computer Science  
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement.  ...  The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the random oracle model.  ...  In this paper, we consider the problem of designing threshold cryptosystems that are secure against chosen ciphertext attack.  ... 
doi:10.1007/bfb0054113 fatcat:gtd6cxk5rfdn5htqil4yjfxp6m

Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks [chapter]

Pierre-Alain Fouque, David Pointcheval
2001 Lecture Notes in Computer Science  
This new construction provides the first example of threshold cryptosystem secure against chosen-ciphertext attacks based on the factorization problem.  ...  Semantic security against chosen-ciphertext attacks (IND-CCA) is widely believed as the correct security level for public-key encryption scheme.  ...  Introduction Chosen-Ciphertext Security Semantic security against chosen-ciphertext attacks represents the correct security definition for a cryptosystem [31, 41, 4] .  ... 
doi:10.1007/3-540-45682-1_21 fatcat:xzigglz2obde7p6tvfjrmkykje

An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) [chapter]

Ran Canetti, Shafi Goldwasser
1999 Lecture Notes in Computer Science  
This paper proposes a simple threshold Public-Key Cryptosystem (PKC) which is secure against adaptive chosen ciphertext attack, under the Decisional Diffie-Hellman (DDH) intractability assumption.  ...  Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25] .  ...  Stronger notions of security of centralized encryption schemes, namely security against 'Lunch-time Attacks' and 'chosen ciphertext attacks' (CCA) were defined, constructed, and studied in [33, 38, 19  ... 
doi:10.1007/3-540-48910-x_7 fatcat:psosdgik2ffchjhkq2b4opp7ai

How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack [chapter]

Yitao Duan, John Canny
2006 Lecture Notes in Computer Science  
Moreover, we show that multicast cryptosystems with high level of security (e.g. IND-CCA2) can be based upon public key cryptosystems with weaker (e.g.  ...  We provide new methods for building such cryptosystems with various levels of security (e.g., IND-CPA, IND-CCA2).  ...  All these schemes can be shown to be secure against chosen plaintext attack, but they are not known to withstand chosen ciphertext attack.  ... 
doi:10.1007/11605805_16 fatcat:4azki6re6zh7pce23tfcvogv3m

Cryptanalysis of the Immunized LL Public Key Systems [chapter]

Yair Frankel, Moti Yung
1995 Lecture Notes in Computer Science  
(In fact their scheme is the only grouporiented practical encryption claimed to be secure against chosen ciphertext attacks).  ...  We first demonstrate that the RSA based scheme is insecure under an adaptive chosen ciphertext attack.  ...  Provably secure chosen-ciphertext secure systems : The first solution for such systems was given in [NaorYungSO] which presented a public key cryptosystem secure against chosen ciphertext attack based  ... 
doi:10.1007/3-540-44750-4_23 fatcat:yy5d5ns7mbcoffeazec3jjqqsy

An Computation-Efficient Generalized Group-Oriented Cryptosystem

Ting-Yi Chang
2010 Informatica  
Under the decisional Diffie-Hellman problem assumption, the proposed scheme is demonstrated to be provably secure against chosen plaintext attacks.  ...  Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.'  ...  s GOC is secure against chosen plaintext attacks under the same assumption.  ... 
doi:10.15388/informatica.2010.290 fatcat:qucfb46kbja2hhth5czwbkz3oq

Page 4868 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
Summary: “For the most compelling applications of threshold cryptosystems, security against chosen cipher text attack is a re- quirement.  ...  The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the ran- dom oracle model.  ... 

SCCR: a generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption

Jun Shao, Zhenfu Cao, Peng Liu
2009 Security and Communication Networks  
Due to its usefulness, various PRE schemes have been proposed; however, only one can simultaneously achieve chosen ciphertext security (CCA security) and collusion-resistance.  ...  We address these challenges by using CCA-secure (2, 2) threshold cryptosystem to obtain public verifiability, and the method of key management in identity-based encryption (IBE) to achieve collusion-resistance  ...  In the random oracle model, the SG1 threshold cryptosystem is secure against chosen ciphertext attack based on the computational Diffie-Hellman assumption.  ... 
doi:10.1002/sec.109 fatcat:u23x3lhy6rbt3hxa45slvzw7lm

MPKC-based Threshold Proxy Signcryption Scheme

Li Huixian, Gao Jin, Wang Lingyun, Pang Liaojun2
2019 ˜The œinternational Arab journal of information technology  
insecure against quantum attacks.  ...  However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes the existing threshold proxy signcryption schemes based on traditional public key cryptosystems  ...  UF-MTPSC-CMA-CWA (existential unforgeability against chosen message attacks and chosen warrant attacks of Threshold Proxy Signcryption scheme based on Multivariate Public Key Cryptosystem) where lm is  ... 
doi:10.34028/iajit/17/2/7 fatcat:iegatna52fanlkyvo654g4uy4u

Sharing Decryption in the Context of Voting or Lotteries [chapter]

Pierre-Alain Fouque, Guillaume Poupard, Jacques Stern
2001 Lecture Notes in Computer Science  
Several public key cryptosystems with additional homomorphic properties have been proposed so far.  ...  In this paper, we propose a distributed version of the Paillier cryptosystem presented at Eurocrypt '99.  ...  Previous de nitions of threshold cryptosystems secure against Chosen Ciphertext Attack CCA have been formalized as a natural extension of the standard de nitions of CCA-security in 9 .  ... 
doi:10.1007/3-540-45472-1_7 fatcat:o364zdkyjjc3tiupjmi25ogmwm

Page 6757 of Mathematical Reviews Vol. , Issue 2000i [page]

2000 Mathematical Reviews  
Summary: “For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack seems to be a requirement.  ...  The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the random hash function model.”  ... 

Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment

Oleg Izmerly, Tal Mor
2006 Theoretical Computer Science  
In this paper we present chosen ciphertext attacks (CCA) against all three cryptosystems.  ...  Our attack shows that these cryptosystems are totally insecure against CCA, because the private keys can be recovered in polynomial time.  ...  We thank Erez Petrank, Yuval Ishai, Moni Naor and Eli Biham for fruitful discussions regarding protection of PKE against chosen ciphertext attack.  ... 
doi:10.1016/j.tcs.2006.07.060 fatcat:7fd2bjvqorgmhmacoiyjoxjqoy

On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? [chapter]

Rui Zhang, Goichiro Hanaoka, Junji Shikata, Hideki Imai
2004 Lecture Notes in Computer Science  
Especially, this may not be true according to (adaptive) chosen ciphertext attack (CCA), even with all component ciphers CCA secure.  ...  We define an extended version of CCA called chosen ciphertext attack for multiple encryption (ME-CCA) to emulate real world partial breaking of assumptions, and give constructions of multiple encryption  ...  plaintext attack. 2 7.2 Chosen ciphertext security of generic construction in [13] One may naturally think the generic construction in [13] is secure against chosen ciphertext attacks if the underlying  ... 
doi:10.1007/978-3-540-24632-9_26 fatcat:mdlloxy2dvbnbphg6om4kcj5ri

Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts

Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols
2008 Electronical Notes in Theoretical Computer Science  
We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.  ...  Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements.  ...  If atk is a partial chosen ciphertext attack (CCA1), then O 1 = PKE.Dec(sk, ·) and O 2 = . Finally, if atk is a full chosen ciphertext attack (CCA2), then O 1 = O 2 = PKE.Dec(sk, ·).  ... 
doi:10.1016/j.entcs.2008.05.002 fatcat:37ooz4jjzzgcbiesyjbwnhs6ky
« Previous Showing results 1 — 15 out of 1,827 results