385 Hits in 5.4 sec

Generic insecurity of cliques-type authenticated group key agreement protocols

O. Pereira, J.-J. Quisquater
Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.  
Definition 2.1 A Group Key Agreement Protocol is a protocol enabling a group of n users M = {M 1 , . . . , M n } to contributively generate a key that should be known by all group members at the end of  ...  The A-GDH.2 and SA-GDH.2 authenticated group key agreement protocols showed to be flawed in 2001.  ...  Acknowledgements We would like to thank the anonymous reviewers from CSFW-17 and the Journal of Computer Security for very helpful comments on previous versions of this paper.  ... 
doi:10.1109/csfw.2004.1310729 fatcat:twlj65l5erfd7cn42nlispm2ky

Secure group communication using robust contributory key agreement

Y. Amir, Yongdae Kim, C. Nita-Rotaru, J.L. Schultz, J. Stanton, G. Tsudik
2004 IEEE Transactions on Parallel and Distributed Systems  
Contributory group key agreement protocols generate group keys based on contributions of all group members.  ...  Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many types of attacks.  ...  We do not assume authenticity of membership events. Authentication of new members is obtained as part of group key management.  ... 
doi:10.1109/tpds.2004.1278104 fatcat:ealehd2ll5a7rnk4vkejto5oyu

On the performance of group key agreement protocols

Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, Gene Tsudik
2004 ACM Transactions on Privacy and Security  
Focus Our previous work showed how provably secure, multiround group key agreement protocols can be integrated with a reliable group communication system to obtain provably fault-tolerant group key agreement  ...  Specifically, we designed a robust contributory key agreement protocol resilient to any sequence of (possibly cascaded) events and proved that the resulting protocol preserved group communication membership  ...  We also thank Ryan Caudy for providing a tool to generate partitions and merges for Spread servers.  ... 
doi:10.1145/1015040.1015045 fatcat:uiinlzgpwzaijevhwvqgk3proe

An Efficient Group Key Transfer protocol for Secure Encryption

A.V.V.S. Murthy, P. Vasudeva Reddy
2019 Journal of Physics, Conference Series  
In this paper, we present a generic construction of asymmetric key Group key transfer protocol using one way function and coding theory technique.  ...  By guaranteeing the freshness of authentication messages, the authenticity of the generator of authentication messages and the completeness of the authenticator, the improved protocol can resist various  ...  There are two types of attacks that exist in a group key transfer protocol; 1)Insider attack, 2)Outsider attack.  ... 
doi:10.1088/1742-6596/1344/1/012003 fatcat:kojojabdqjbxjlgqc4oixppfvi

The architecture and performance of security protocols in the ensemble group communication system: Using diamonds to guard the castle

Ohad Rodeh, Kenneth P. Birman, Danny Dolev
2001 ACM Transactions on Privacy and Security  
We extend previous results on group rekeying, with a novel protocol that makes use of diamond-like data structures. Our Diamond protocol allows the removal of untrusted members within milliseconds.  ...  Unlike Horus, which used its own security infrastructure with non-standard key distribution and timing services, Ensemble's security mechanism is based on off-the shelf authentication systems, such as  ...  Secure key agreement in a group: This is the problem of providing a protocol whereby secure agreement can be reached among group members which need to select a mutual key.  ... 
doi:10.1145/501978.501982 fatcat:jggdpnxhsvauzia6r5mmoeozgq

mpENC Multi-Party Encrypted Messaging Protocol design document [article]

Ximin Luo, Guy Kloss
2016 arXiv   pre-print
This document is a technical overview and discussion of our work, a protocol for secure group messaging.  ...  We aim towards a general-purpose unified protocol.  ...  All participants of the CLIQUES key agreement can be considered equal in terms of the protocol functionality. CLIQUES does not protect against active attackers.  ... 
arXiv:1606.04598v1 fatcat:yygtbqrhffbzdnborlrr4kmine

Breaking and making quantum money: toward a new quantum cryptographic protocol [article]

Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan Kelner, Peter Shor
2009 arXiv   pre-print
We introduce a category of quantum money protocols which we call collision-free. For these protocols, even the bank cannot prepare multiple identical-looking pieces of quantum money.  ...  There are no secure public-key quantum money schemes in the literature; as we show in this paper, the only previously published scheme [1] is insecure.  ...  We will refer to protocols of this type as quantum money with a classical secret.  ... 
arXiv:0912.3825v1 fatcat:d54hns42ubapxikdadmurhjlne

Secure Spread: An Integrated Architecture for Secure Group Communication

Y. Amir, C. Nita-Rotaru, J. Stanton, G. Tsudik
2005 IEEE Transactions on Dependable and Secure Computing  
We discuss performance and accompanying trust issues of each proposed architecture and present experimental results that demonstrate the superior scalability of an integrated architecture.  ...  Group communication systems are high-availability distributed systems providing reliable and ordered message delivery as well as a membership service, to group-oriented applications.  ...  We refer to protocols that generate and maintain a shared group key as group key management protocols.  ... 
doi:10.1109/tdsc.2005.39 fatcat:eksalcxi2bc3rkqyladmzom4e4

Secure Collaborative Key Management for Dynamic Groups in Mobile Networks

Sukin Kang, Cheongmin Ji, Manpyo Hong
2014 Journal of Applied Mathematics  
key authentication under the decisional Diffie-Hellman (DDH) assumption.  ...  We conduct mathematical evaluation with other group key management protocols and finally prove its security by demonstrating group key secrecy, backward and forward secrecy, key independence, and implicit  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/601625 fatcat:xohxy7le4jhg5h4sfz6qd37rnu

Multichannel Security Protocols

Ford Long Wong, Frank Stajano
2007 IEEE pervasive computing  
ACKNOWLEDGMENTS We thank our colleagues in the Security Group and the Digital Technology Group at the University of Cambridge's Computer Laboratory for providing a stimulating environment in which to conduct  ...  A hen more than two devices must establish a common secret, we can build on a multiparty extension toDiffie- Hellman,1 such as the Cliques Group Key Agreement (GKA) protocol suite.  ...  The sidebar "Multichannel Group Key Agreement" discusses how to extend such a protocol to more than two parties.  ... 
doi:10.1109/mprv.2007.76 fatcat:6xjjm4odgbeefa6wumsdc3uz4m

Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures [chapter]

Graham Steel, Alan Bundy, Monika Maidl
2004 Lecture Notes in Computer Science  
Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement.  ...  In this paper, we describe Coral, our system for finding security protocol attacks by refuting incorrect inductive conjectures. We have used Coral to model a group key protocol in a general way.  ...  However, very few of these are able to analyse protocols for group key agreement, where an unbounded number of parties may be involved in a single round, [21, 27] .  ... 
doi:10.1007/978-3-540-25984-8_8 fatcat:n2mxlvga4jhgvhxlt5gcmytezi

Security Architecture for Sensitive Information Systems [chapter]

Xianping Wu, Phu Dung, Balasubramaniam Srinivas
2010 Convergence and Hybrid Information Technologies  
By applying the nature of dynamic keys 46 , if the agreements (Section 4.1.1) are followed, the security of the proposed architecture is guaranteed.  ...  Criteria Key Management Approaches Communication Channel User Interface Sensitive Information Storage DKM Unicast Multicast Key Type long-term group long-term long-term public long-term public dynamic  ...  Contributory Key Agreement Contributory key agreement (also called distributed key agreement) generates a group key via all group members' uniform contributions. m m od i R p   1 i m  The  ... 
doi:10.5772/9641 fatcat:cdq2t26wcfc3vc5czgqog3h5pu

Consistent Synchronous Group Off-The-Record Messaging with SYM-GOTR

Michael Schliep, Eugene Vasserman, Nicholas Hopper
2018 Proceedings on Privacy Enhancing Technologies  
In contrast to previous work, SYM-GOTR is the first protocol to offer confidential, authenticated, and repudiable conversations among a dynamic group with the additional properties of message unlinkability  ...  We describe SYM-GOTR, a protocol for secure Group Off-The-Record (GOTR) messaging.  ...  Liu, Vasserman, and Hopper [4] proposed an improved group OTR (GOTR) protocol which we refer to as BD-GOTR due to its use of the Burmester-Desmedt group key agreement protocol.  ... 
doi:10.1515/popets-2018-0027 dblp:journals/popets/SchliepVH18 fatcat:cypqlbggxvdbtfuzlh45ouilu4

A survey of ring-building network protocols suitable for command and control group communications

Ahmed Sobeih, William Yurcik, Edward M. Carapezza
2005 Sensors, and Command, Control, Communications, and Intelligence (C3I) Technologies for Homeland Security and Homeland Defense IV  
, reconfigurability with respect to group dynamics, scalability, security, reliability and extensibility to support different types of data).  ...  constant and independent of the size of the multicast group; this significantly reduces the complexity in, for example, the key distribution mechanism, (2) Reliable and totally-ordered message delivery  ...  (using Group Diffie-Hellman), and (b) a simple centralized key distribution (CKD) protocol. 27 Cliques 40-42 is a cryptographic protocol suite, which provides authenticated contributory group key management  ... 
doi:10.1117/12.604204 fatcat:ecrompt4tfh3zf7lzpmzgi4cta

Attacking Group Protocols by Refuting Incorrect Inductive Conjectures

Graham Steel, Alan Bundy
2005 Journal of automated reasoning  
Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement.  ...  In this paper, we describe Coral, our system for finding security protocol attacks by refuting incorrect inductive conjectures. We have used Coral to model a group key protocol in a general way.  ...  However, very few of these are able to analyse protocols for group key agreement, where an unbounded number of parties may be involved in a single round, [21, 27] .  ... 
doi:10.1007/s10817-005-9016-8 fatcat:horv5rbuqvhg7khu4d5d3r54w4
« Previous Showing results 1 — 15 out of 385 results