19,033 Hits in 8.2 sec

Encryption-Scheme Security in the Presence of Key-Dependent Messages [chapter]

John Black, Phillip Rogaway, Thomas Shrimpton
2003 Lecture Notes in Computer Science  
Here we introduce a new notion of security, KDM security, appropriate for key-dependent messages. The notion makes sense in both the public-key and shared-key settings.  ...  This paper defines and begins to investigate a new notion for encryption-scheme security: KDM security. KDM stands for key-dependent messages.  ...  Part of this work was carried out while John was at the University of Nevada, Reno.  ... 
doi:10.1007/3-540-36492-7_6 fatcat:nd5inva6m5gzvaaegbxpp4hjza

Soundness of Formal Encryption in the Presence of Key-Cycles [chapter]

Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
2005 Lecture Notes in Computer Science  
We demonstrate that an encryption scheme provides soundness in the presence of key-cycles if it satisfies the recently-introduced notion of key-dependent message (KDM) security.  ...  We also show that soundness in the presence of key-cycles (and KDM security) neither implies nor is implied by security against chosen ciphertext attack (CCA-2).  ...  Some of our joint work was done during the Protocol eXchange meetings. We thank S. Pinsky, E. Zieglar, and G. Dinolt for organizing the meetings and  ... 
doi:10.1007/11555827_22 fatcat:uq7a3froj5cjtjtnftbvwhkkjq

Security of message authentication codes in the presence of key-dependent messages

Madeline González Muñiz, Rainer Steinwandt
2011 Designs, Codes and Cryptography  
of MACs in the presence of key-dependent messages (KD-EUF).  ...  In recent years, the security of encryption and signature schemes in the presence of key-dependent plaintexts received attention, and progress in understanding such scenarios has been made.  ...  Acknowledgements Madeline González Muñiz's research was supported by the European Regional Development Fund through the Estonian Center of Excellence in Computer Science, EXCS.  ... 
doi:10.1007/s10623-011-9523-z fatcat:rlwmog5nwnbctihbcica3hr3vm


2017 Journal of Natural Sciences, Engineering and Technology  
In order to test the functionality of MLES scheme, it was implemented using Java 1.8.0 and tested on a text data. The result shows a feasible protocol that can secure a message in steganography.  ...  The method involves a multi-level approach that comprises of a key exchange protocol, a message authentication code, a key derivation function and a symmetric encryption known as polyalphabetic substitution  ...  Cryptography is the design and analysis of mathematical techniques that enable secure communications in the presence of malicious adversaries.  ... 
doi:10.51406/jnset.v15i2.1671 fatcat:zv3zcyfr55cdzk2tjpxvq5yzai

Bounded Key-Dependent Message Security [chapter]

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai
2010 Lecture Notes in Computer Science  
Specically, under either the DDH or LWE assumption, and for arbitrary but xed polynomials L and N , we obtain a public-key encryption scheme that resists key-dependent message (KDM) attacks for up to N  ...  We construct the rst public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of arbitrary ecient functions  ...  Let bKDM be an N -key length-dependent KDM secure PKE scheme, and let P be a symbolic protocol with N parties in the setting of Adão et al. [2] .  ... 
doi:10.1007/978-3-642-13190-5_22 fatcat:zsjebslamvfb7eagpyx7vpaebe

On the Joint Security of Encryption and Signature, Revisited [chapter]

Kenneth G. Paterson, Jacob C. N. Schuldt, Martijn Stam, Susan Thomson
2011 Lecture Notes in Computer Science  
We revisit the topic of joint security for combined public key schemes, wherein a single keypair is used for both encryption and signature primitives in a secure manner.  ...  While breaking the principle of key separation, such schemes have attractive properties and are sometimes used in practice.  ...  Informally, we say that a combined scheme is jointly secure if it is both EUF-CMA secure in the presence of a decryption oracle and IND-CCA secure in the presence of a signing oracle.  ... 
doi:10.1007/978-3-642-25385-0_9 fatcat:xxlphywquveqlllnm4zhim4dau

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data [chapter]

Mihir Bellare, Sriram Keelveedhi
2011 Lecture Notes in Computer Science  
This paper provides a comprehensive treatment of the security of authenticated encryption (AE) in the presence of key-dependent data, considering the four variants of the goal arising from the choice of  ...  seurity in the presence of key-dependent data.  ...  We now extend the above along the lines of [17, 6] to provide our definition of security for AE in the presence of key-dependent inputs, considering both key-dependent messages and key-dependent headers  ... 
doi:10.1007/978-3-642-22792-9_35 fatcat:htwppgpbbbfwlezbpryvzccmbm

Security of signature schemes in the presence of key-dependent messages

Madeline González Muñiz, Rainer Steinwndt
2010 Tatra Mountains Mathematical Publications  
In recent years, quite some progress has been made in understand- ing the security of encryption schemes in the presence of key-dependent plaintexts.  ...  We propose a way to formalize the security of signature schemes in the pres- ence of key-dependent signatures (KDS).  ...  A natural question arises about how to combine the security definitions of key-dependent encryption and signing to come up with a signcryption scheme that is secure in the presence of key-dependent messages  ... 
doi:10.2478/v10127-010-0029-2 fatcat:l3g6bll6rncxjnv6plsrelgkpu

Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks [chapter]

Florian Böhl, Gareth T. Davies, Dennis Hofheinz
2014 Lecture Notes in Computer Science  
We construct secret-key encryption (SKE) schemes that are secure against related-key attacks and in the presence of key-dependent messages (RKA-KDM secure).  ...  We emphasize that RKA-KDM security is not merely the conjunction of individual security properties, but covers attacks in which ciphertexts of key-dependent messages under related keys are available.  ...  The authors would like to thank Martijn Stam for useful discussions and Rafael Dowsley for kindling our interest in the topic.  ... 
doi:10.1007/978-3-642-54631-0_28 fatcat:2dhwbhbxbzbwxgvetmvucy5uru

Message-Locked Encryption for Lock-Dependent Messages [chapter]

Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev
2013 Lecture Notes in Computer Science  
We refer to such inputs as lock-dependent messages. We construct two schemes that satisfy our new notions of security for message-locked encryption with lock-dependent messages.  ...  Such schemes do not rely on permanent secret keys, but rather encrypt messages using keys derived from the messages themselves.  ...  We thank the anonymous CRYPTO '13 reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-40041-4_21 fatcat:pfjow4homfeonjpk22nirffx5u

Efficient Lattice-Based Cryptosystems with Key Dependent Message Security

Bo Yang, Ruwei Huang, Jianan Zhao
2021 Applied Sciences  
Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios.  ...  In addition, this scheme enjoys a high level of efficiency, the cost of encryption and decryption is only ploylog(n) bit operations per message symbol, and we also prove that our scheme is KDM-CPA secure  ...  Encryption-Scheme Security in the Presence of Key-Dependent Messages. In International Workshop on Selected Areas in Cryptography; Springer: Berlin/Heidelberg, Germany, 2002; pp. 62–75. 7.  ... 
doi:10.3390/app112412161 fatcat:uijmkhvcc5amvmiyf5knsqrhhu

Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles [chapter]

Xinfeng Lei, Rui Xue, Ting Yu
2011 Lecture Notes in Computer Science  
In this paper, we prove a computational soundness theorem of formal encryption in the presence of both key cycles and secret shares at the same time, which is a non-trivial extension of former approaches  ...  The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway [1] .  ...  Specifically, Adão et al. adopt another security notion, i.e., Key-Dependent Message(KDM) security [23] in which the messages are chosen depending on the keys of the encryption scheme itself.  ... 
doi:10.1007/978-3-642-25243-3_3 fatcat:v7qzma6vszcfvfbiz4xbqxke6u

Cryptography On Android Message Application Using Look Up Table And Dynamic Key (Cama)

Manisha Madhwani
2012 IOSR Journal of Computer Engineering  
Most popular shortest and cheapest textual form of communication is short message service (SMS).To ensure the security of the texts which is sent, many algorithm are available.  ...  The proposed algorithm is more secure and simple to implement. This application makes use of built in android Intents and SMS Manager to send and receive messages.  ...  (ii) Cryptography: Cryptography is the practice and study of techniques for secure communication in the presence of third parties [13] .  ... 
doi:10.9790/0661-0625459 fatcat:jjwzeyepgbcbzeccwuf4rfcqfe

A Key-Ordered Decisional Learning Parity with Noise (DLPN) Scheme for Public Key Encryption Scheme in Cloud Computing

Tarasvi Lakum, B.Thirumala Rao
2019 International Journal of Advanced Computer Science and Applications  
The proposed scheme uses DLPN by extending it to an even-odd-order scheme, depend on the value of probability distribution of odd and even bits for encryption, where odd and even bits are the input integer  ...  The variation of decisional learning parity with noise (DLPN) named as key-Ordered DLPN based security algorithm is presented in this work.  ...  PROPOSED KEY ENCRYPTION SCHEME A. Proposed Scheme Proposed scheme uses two prime messages in an order with the increased size.  ... 
doi:10.14569/ijacsa.2019.0101121 fatcat:ucr4cvup55ba7gidlow5kbfwty

Signature Schemes Secure Against Hard-to-Invert Leakage

Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel
2015 Journal of Cryptology  
In this work, we propose the first constructions of digital signature schemes that are secure in the auxiliary input model.  ...  Our main contribution is a digital signature scheme that is secure against chosen message attacks when given an exponentially hard-to-invert function of the secret key.  ...  The authors thank Yevgeniy Dodis for discussions at an early stage of this project.  ... 
doi:10.1007/s00145-015-9197-1 fatcat:gv752itwbzdlfamfrc6aigft4i
« Previous Showing results 1 — 15 out of 19,033 results