Filters








12,625 Hits in 1.9 sec

Data Security Analysis Against Chosen Ciphertext Secure Public Key Attack Using Threshold Encryption Scheme

Khairunas, Muhammad Zarlis, Sawaluddin
2021 Randwick International of Social Science Journal  
above problems can be analyzed for Data Security Against Chosen Ciphertext Secure Public Key Attacks Using Threshold Encryption Schemes.  ...  Solving the problems above can use the Chosen Ciphertext Secure Public Key Threshold Encryption scheme but are the securities from Threshold Encryption really strong in securing messages, therefore the  ...  The combiner then performs a generic security proof analysis of the threshold encryption algorithm whether it is really safe and strong against attacks from Chosen Ciphertext Secure (CCA).  ... 
doi:10.47175/rissj.v2i3.275 fatcat:x6pz7vfe7vfm3lnsi6ekctfubm

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.  ...  Chosen ciphertext security For many years, no public key system [DiffieHellman76] was shown to be secure under a chosen ciphertext attack.  ... 
doi:10.1007/3-540-44750-4_23 fatcat:yy5d5ns7mbcoffeazec3jjqqsy

On the security of RSA textbook signature scheme on Paillier ciphertext

Aleksejus Mihalkovich, Eligijus Sakalauskas
2016 Lietuvos matematikos rinkinys  
Our goal is to show that this combination of algorithms provide security against chosen plaintext and chosen ciphertext attacks.  ...  We show that due to valuable homomorphic property these algorithms can be used together to obtain a valid signature on a certain combination of ciphertexts.  ...  Vaudenay showed in [6] , that in this case our scheme is secure against chosen plaintext attack (CPA) and chosen ciphertext attack (CCA) respectively (Theorem 7).  ... 
doi:10.15388/lmr.a.2016.16 fatcat:37635qzilzafpgoq2arvrvhao4

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security [chapter]

Susan Hohenberger, Allison Lewko, Brent Waters
2012 Lecture Notes in Computer Science  
We present a new approach for creating chosen ciphertext secure encryption. The focal point of our work is a new abstraction that we call Detectable Chosen Ciphertext Security (DCCA).  ...  We show how to build chosen ciphertext secure systems from DCCA security.  ...  Acknowledgments The authors thank Steven Myers and the anonymous reviewers for helpful comments.  ... 
doi:10.1007/978-3-642-29011-4_39 fatcat:i4iloimg6ngfrhrodviztrnzxe

Chosen-Ciphertext Security of Multiple Encryption [chapter]

Yevgeniy Dodis, Jonathan Katz
2005 Lecture Notes in Computer Science  
Here, in addition to formalizing the problem of chosen-ciphertext security for multiple encryption, we give simple, efficient, and generic constructions of multiple encryption schemes secure against chosen-ciphertext  ...  Subsequent work has sometimes assumed that these solutions are also secure against chosen-ciphertext attacks when component schemes with stronger security properties are used.  ...  Motivation for our Work Chosen-ciphertext security ("CCA security") is as much of a concern in each of the above settings as it is in the case of standard encryption.  ... 
doi:10.1007/978-3-540-30576-7_11 fatcat:y23gb2h6ybhibjdz55xnjdfefa

Securely combining public-key cryptosystems

Stuart Haber, Benny Pinkas
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
We demonstrate this for a variety of public-key encryption schemes that are secure against chosen-ciphertext attacks, and for a variety of digital signature schemes that are secure against forgery under  ...  chosen-message attacks.  ...  In the standard model we give combined-scheme security results for several schemes: We treat the Cramer-Shoup scheme, which provides chosen ciphertext security against adaptive attacks without any random-oracle  ... 
doi:10.1145/501983.502013 dblp:conf/ccs/HaberP01 fatcat:2arxeim56zgg7jkvtjurswrafu

Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles [chapter]

Dan Boneh, Xavier Boyen, Shai Halevi
2006 Lecture Notes in Computer Science  
Security of TPKE is defined using two properties: security against chosen ciphertext attacks, and consistency of decryptions.  ...  We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles.  ...  The construction illustrates the benefits of building chosen ciphertext security from identity based encryption.  ... 
doi:10.1007/11605805_15 fatcat:cjp3ij42enfvljv5o62oo4cl3q

Authenticated On-Line Encryption [chapter]

Pierre-Alain Fouque, Antoine Joux, Gwenaëlle Martinet, Frédéric Valette
2004 Lecture Notes in Computer Science  
In this paper, we investigate the authenticated encryption paradigm, and its security against blockwise adaptive adversaries, mounting chosen ciphertext attacks on on-the-fly cryptographic devices.  ...  We remark that most of the existing solutions are insecure in this context, since they provide a decryption oracle for any ciphertext.  ...  However, the already known chosen ciphertext attack on the CBC can be performed in the blockwise setting (see [16] for a detailed description of it) even if the DCBC is combined with the secure EMAC  ... 
doi:10.1007/978-3-540-24654-1_11 fatcat:cfwqbclbbrc23hnuzbfhvrru2a

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.  ...  Just as for ordinary, non-threshold cryptosystems, a natural and very useful notion of security is that of security 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.  ...  Just as for ordinary, non-threshold cryptosystems, a natural and very useful notion of security is that of security against chosen ciphertext attack.  ... 
doi:10.1007/bfb0054113 fatcat:gtd6cxk5rfdn5htqil4yjfxp6m

Light-Weight Encryption Schemes for Multimedia Data and High-Speed Networks

Feng Bao, Robert H. Deng
2007 IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference  
We then combine a secure block cipher with a super-fast stream cipher such that the resulting encryption scheme possesses both the speed of the stream cipher and the security of the block cipher.  ...  No existing encryption algorithms are both fast enough for high-speed operation and sufficiently secure to withstand powerful cryptanalysis.  ...  However, the secret key of our scheme cannot be derived by chosen plaintext/ciphertext attacks due to using a secure SE.  ... 
doi:10.1109/glocom.2007.43 dblp:conf/globecom/BaoD07 fatcat:vfit3gebvvhk5lkodlplqthvtm

Spread Spectrum Encryption Architecture SSEA: A New Encryption Architecture for Post Quantum Computing - Design and Analysis

M. Megahed, Dimitrios Makrakis, H. Mouftah, Carlisle Adams
2013 International Conference on Aerospace Sciences and Aviation Technology  
Third, cryptanalysis cannot take place over SSEA; the only way for the attacker to break SSEA is to establish brute force attack over all of the system possible combinations.  ...  Finally, SSEA3 is chosen to be implemented as it has the highest speed, the lowest design size and the highest security level over SSEA1, SSEA2 and AES-256 full rounds.  ...  System analysis The only way for the attacker to break the system is to try all possible combinations of the PRNG for each ciphertext pair.  ... 
doi:10.21608/asat.2013.22186 fatcat:d3kjc3okcfef5hf4ujmobbvwpi

Multipurpose Identity-Based Signcryption [chapter]

Xavier Boyen
2003 Lecture Notes in Computer Science  
We require the usual strong security properties of: (for confidentiality) indistinguishability against adaptive chosen-ciphertext attacks, and (for nonrepudiation) existential unforgeability against chosen-message  ...  We first propose a stringent security model for IBSE schemes.  ...  Credit goes to Guido Appenzeller for suggesting the "Swiss Army Knife" moniker.  ... 
doi:10.1007/978-3-540-45146-4_23 fatcat:ydx75ljgf5a2li4ksdbdder4mi

Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions [chapter]

Seiko Arita, Koji Tsurudome
2009 Lecture Notes in Computer Science  
A threshold public-key encryption scheme TPKE consists of five algorithms: TPKE = (Setup, Encrypt, ShareDec, ShareVf, Combine).  ...  stag-CCA-secure threshold tag-based encryption schemes to CCA-secure threshold public-key encryption schemes.  ...  First, we consider chosen ciphertext security of TPKE. Let A be an arbitrary efficient adversary against chosen ciphertext security of TPKE.  ... 
doi:10.1007/978-3-642-01957-9_12 fatcat:juxzcsfhffg5habzuztoow2qaa

The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) [chapter]

Hugo Krawczyk
2001 Lecture Notes in Computer Science  
We show that any secure channels protocol designed to work with any combination of secure encryption (against chosen plaintext attacks) and secure MAC must use the encrypt-then-authenticate method.  ...  We study the question of how to generically compose symmetric encryption and authentication when building "secure channels" for the protection of communications over insecure networks.  ...  Acknowledgment I would like to thank Yaron Scheffer for motivating conversations on this topic and for "forcing" me to find an explicit counter-example for the AtE method; Yaron also helped in simplifying  ... 
doi:10.1007/3-540-44647-8_19 fatcat:234eabhznzczvf5bvernyil4nm
« Previous Showing results 1 — 15 out of 12,625 results