Filters








217,037 Hits in 7.7 sec

Delayed-Key Message Authentication for Streams [chapter]

Marc Fischlin, Anja Lehmann
2010 Lecture Notes in Computer Science  
We consider message authentication codes for streams where the key becomes known only at the end of the stream.  ...  Here we take a formal approach to this problem of delayed-key MACs and provide solutions which are "as secure as schemes where the key would be available right away" but still allow to compute the MACs  ...  Acknowledgments We thank Yevgeniy Dodis, Stefan Lucks and the anonymous reviewers for valuable comments.  ... 
doi:10.1007/978-3-642-11799-2_18 fatcat:ycv2t3spavgczpf7m3sgcrycxi

Deniable Key Exchanges for Secure Messaging

Nik Unger, Ian Goldberg
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
Deniable authenticated key exchanges (DAKEs), the cryptographic protocols responsible for providing deniability in secure messaging applications, cannot currently provide all desirable properties simultaneously  ...  A widespread weakness of existing solutions is the lack of strong deniability properties that allow users to plausibly deny sending messages or participating in conversations if the security of their communications  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their insightful comments and feedback. We gratefully acknowledge the support of NSERC and the Ontario Research Fund.  ... 
doi:10.1145/2810103.2813616 dblp:conf/ccs/UngerG15 fatcat:i5crh7s75ffzzcn4mcdfv4ooca

A replay-attack resistant message authentication scheme using time-based keying hash functions and unique message identifiers [article]

Boudhayan Gupta
2016 arXiv   pre-print
Hash-based message authentication codes are an extremely simple yet hugely effective construction for producing keyed message digests using shared secrets.  ...  We propose a construction that extends HMACs to produce a keyed message digest that has a finite validity period.  ...  Kumar Vishal for his help with understanding the mathematics behind birthday attacks.  ... 
arXiv:1602.02148v1 fatcat:4r5ptnxwajhexovwuhtcqicjx4

Secure Message Authentication Against Related-Key Attack [chapter]

Rishiraj Bhattacharyya, Arnab Roy
2014 Lecture Notes in Computer Science  
We present a general construction of related-key secure MACs.  ...  We start with the definitions of related-key security of Message Authentication Codes and identify required properties of relatedkey derivation functions for provable security.  ...  Acknowledgements We thank Mridul Nandi for useful discussions. We also thank Damien Stehlé for important feedback on the initial draft of the paper.  ... 
doi:10.1007/978-3-662-43933-3_16 fatcat:yz3xlvuk4zcgvbets5efbfc5sm

OAEP Is Secure under Key-Dependent Messages [chapter]

Michael Backes, Markus Dürmuth, Dominique Unruh
2008 Lecture Notes in Computer Science  
definitions for public-key security.  ...  Key-dependent message security, short KDM security, was introduced by Black, Rogaway and Shrimpton to address the case where key cycles occur among encryptions, e.g., a key is encrypted with itself.  ...  The same holds for later results [1, 26, 6, 27, 29, 4, 18, 17] . Motivated primarily by symbolic cryptography, a definition of key-dependent message security (KDM security) was introduced in [13] .  ... 
doi:10.1007/978-3-540-89255-7_31 fatcat:hetrzdtttbe7bmxg2rbni24jpm

Generalized Key Substitution Attacks on Message Recovery Signatures

Atsushi Fujioka
2017 Tatra Mountains Mathematical Publications  
The generalized key substitution attacks were proposed as a generalization of the key substitution attacks to examine the security of the signature schemes adopted in ISO/IEC (1st CD) 14888-3, which standardizes  ...  This paper examines the message recovery signature schemes based on the discrete logarithm problem, adopted in ISO/IEC 9796-3:2006, and shows that all but one scheme are vulnerable to the generalized key  ...  In a digital signature scheme, an entity, called signer, has a private-key and can generate a signature for each message.  ... 
doi:10.1515/tmmp-2017-0022 fatcat:n2fuyycwqfgktm4ctf6f3nsgye

Landau-Ramanujan keyed hash functions for message authentication

A. Suganya, N. Vijayarangan
2006 Journal of Discrete Mathematical Sciences and Cryptography  
An algorithm is newly developed for keyed hash functions using Landau-Ramanujan constant. It is tested well for message authentication and digital signatures.  ...  The security analysis on this algorithm is compared with [1] and then the algorithm passes validation tests.  ...  For validation, the proposed algorithm passes 3 primary tests such as short messages, long messages and pseudo randomly generated messages. Further, test vectors are also provided in this paper.  ... 
doi:10.1080/09720529.2006.10698056 fatcat:cmrvubylpzeuhbjgiwyrsspmfq

Composable, Unconditionally Secure Message Authentication without any Secret Key [article]

Dimiter Ostrev
2018 arXiv   pre-print
We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is able to correctly decode a message coming from Alice and reject a message  ...  The system does not require any secret key shared between Alice and Bob, provides information theoretic security, and can safely be composed with other protocols in an arbitrary context.  ...  Thus, Alice's messages pass through a discrete memoryless channel with transition probabilities P and Eve's messages pass through a discrete memoryless channel with transition probabilities Q.  ... 
arXiv:1804.01797v1 fatcat:2mohvtgzlzhltg2ie3fswzx5ue

Distributed key management for secure role based messaging

G. Zhao, S. Otenko, D. Chadwick
2006 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)  
Secure Role Based Messaging (SRBM) augments messaging systems with role oriented communication in a secure manner. Role occupants can sign and decrypt messages on behalf of roles.  ...  This paper identifies the requirements of SRBM and recognises the need for: distributed key shares, fast membership revocation, mandatory security controls and detection of identity spoofing.  ...  Introduction The Secure Role based Messaging (SRBM) model [4] provides a model for role oriented communication.  ... 
doi:10.1109/aina.2006.146 dblp:conf/aina/ZhaoOC06 fatcat:uyowyd2m65codeheppktl7zziu

Key-Dependent Message Security: Generic Amplification and Completeness [chapter]

Benny Applebaum
2011 Lecture Notes in Computer Science  
Key-dependent message (KDM) secure encryption schemes provide secrecy even when the attacker sees encryptions of messages related to the secret-key sk.  ...  Specifically, we show that an elementary form of KDM security against functions in which each output bit either copies or flips a single bit of the key (aka projections) can be amplified into KDM security  ...  We thank Iftach Haitner, Yuval Ishai, and the anonymous referees for their helpful comments.  ... 
doi:10.1007/978-3-642-20465-4_29 fatcat:kzgzlwe2anb7nleklbunczb3fe

Key-Dependent Message Security: Generic Amplification and Completeness

Benny Applebaum
2013 Journal of Cryptology  
Key-dependent message (KDM) secure encryption schemes provide secrecy even when the attacker sees encryptions of messages related to the secret-key sk.  ...  Specifically, we show that an elementary form of KDM security against functions in which each output bit either copies or flips a single bit of the key (aka projections) can be amplified into KDM security  ...  We thank Iftach Haitner, Yuval Ishai, and the anonymous referees for their helpful comments.  ... 
doi:10.1007/s00145-013-9149-6 fatcat:gumfebxpofhrnptgairywq7foq

Quantum no-key protocol for secure communication of classical message [article]

Li Yang
2013 arXiv   pre-print
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic  ...  Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.  ...  Conclusion We propose a new kind of quantum no-key protocol with provable informationtheoretic security.  ... 
arXiv:1306.3388v1 fatcat:h5ekpcxycff2rfrafzu7p3ij2y

Securing AODV for MANETs using Message Digest with Secret Key [article]

Kamaljit Lakhtaria , N. N. Jani Ganpat Vidyanagar, Kherava, Gujarat, India,, S K Patel Gandhinagar, India)
2012 arXiv   pre-print
for MANETs using Message Digest with Secret Key", by Sunil J.  ...  This article has been withdrawn by arXiv admins because it contains plagiarized content from International Conference on Computer Networks and Security (ICCNS 2008, September 27-28, 2008): "Securing AODV  ...  CONCLUSION In this paper we have presented a message digest with secret key mechanism for securing the AODV routing protocol used in MANET.  ... 
arXiv:1004.0777v2 fatcat:5d3s5tf2xrekdgzzg2uzux226y

Efficient key-dependent message authentication in reconfigurable hardware

Jeremie Crenne, Pascal Cotret, Guy Gogniat, Russell Tessier, Jean-Philippe Diguet
2011 2011 International Conference on Field-Programmable Technology  
Cryptographic message authentication is a growing need for FPGA-based embedded systems.  ...  The implementation limits GHASH logic utilization by specializing the hardware implementation on a per-key basis.  ...  From AES-GCM specifications, a single key allows for the authentication of 4 GByte/s (32 Gbit/s) of data over 64 years without compromised security [2] .  ... 
doi:10.1109/fpt.2011.6132722 dblp:conf/fpt/CrenneCGTD11 fatcat:nttxw3nmdfec3epbzmhsholcea

Dual Layer Textual Message Cryptosystem with Randomized Sequence of Symmetric Key [article]

Chandranath Adak
2013 arXiv   pre-print
This paper introduces a new concept of textual message encryption and decryption through a pool of randomized symmetric key and the dual layer cryptosystem with the concept of visual cryptography and steganography  ...  A textual message is converted into two image slides, and the images are encrypted through two different randomized sequences of symmetric key. The decryption is done in the reverse way.  ...  Chaudhuri, Head, Computer Vision and Pattern Recognition Unit, Indian Statistical Institute, Kolkata 700108, India, for discussion various aspects of this paper.  ... 
arXiv:1312.5424v1 fatcat:6qzqa74xevem7lwj7crcseucca
« Previous Showing results 1 — 15 out of 217,037 results