Results 211 to 220 of about 1,054,507 (259)
Some of the next articles are maybe not open access.
Multiterminal Secret Key Agreement
IEEE Transactions on Information Theory, 2014The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels.
Chung Chan, Lizhong Zheng
openaire +1 more source
On key agreement and conference key agreement
1997An attack is demonstrated on a previously proposed class of key agreement protocols. Analysis of the attack reveals that a small change in the construction of the protocols is sufficient to prevent the attack. The insight gained allows a generalisation of the class to a new design for conference key agreement protocols.
openaire +1 more source
Key Agreement in Ad Hoc Networks
International Journal of Computational Science and Engineering, 2003A new key agreement protocol based on a shared conference password is proposed in this paper. With this protocol, it provides an efficient algorithm and takes less computation cost to construct a secret communication channel. Besides, the honest participant can use passwords to authenticate the other participants.
Ren-Junn Hwang, Rong-Chi Chang
openaire +1 more source
Agreement of a restricted secret key
2012 IEEE International Symposium on Information Theory Proceedings, 2012A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is derived. The maximum key rate strongly achievable with positive exponents is characterized. The result leads to class of admissible restrictions on the key
openaire +1 more source
Exploring robustness in group key agreement
Proceedings 21st International Conference on Distributed Computing Systems, 2000Secure group communication is crucial for building distributed applications that work in dynamic environments and communicate over unsecured networks (e.g. the Internet). Key agreement is a critical part of providing security services for group communication systems.
Yair Amir +5 more
openaire +1 more source
A Promising Key Agreement Protocol
2003In 1999, Seo and Sweeney proposed a simple authenticated key agreement protocol(SAKA) that was designed to act as a Diffie-Hellman scheme with user authentication. However, the protocol was subsequently found to have security flaws and enhanced in the literature. Recently, Ku and Wang showed a variant of SAKA.
Eun-Kyung Ryu +2 more
openaire +1 more source
An Efficient Protocol for Authenticated Key Agreement
Designs, Codes and Cryptography, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laurie Law +4 more
openaire +1 more source
On the performance of group key agreement protocols
Proceedings 22nd International Conference on Distributed Computing Systems, 2003Group key agreement is a fundamental building block for secure peer group communication systems. Several group key management techniques were proposed in the last decade, all assuming the existence of an underlying group communication infrastructure to provide reliable and ordered message delivery as well as group membership information.
Yair Amir +3 more
openaire +1 more source
2006
Especially for key establishment protocols to be used in internet applications, the (privacy) concern of deniability arises: Can a protocol transcript be used—possibly by a participant—to prove the involvement of another party in the protocol? For two party key establishment protocols, a common technique for achieving deniability is the replacement of ...
Jens-Matthias Bohli, Rainer Steinwandt
openaire +1 more source
Especially for key establishment protocols to be used in internet applications, the (privacy) concern of deniability arises: Can a protocol transcript be used—possibly by a participant—to prove the involvement of another party in the protocol? For two party key establishment protocols, a common technique for achieving deniability is the replacement of ...
Jens-Matthias Bohli, Rainer Steinwandt
openaire +1 more source
2004
Mit der Verbreitung offener Netze, insbesondere des Internets, fand auch die Gruppenkommunikation eine rasante Verbreitung. Eine Vielzahl heutiger Protokolle sind gruppen-orientiert: angefangen bei Multicast-Diensten in der Netzwerkschicht bis hin zu Videokonferenzsystemen auf der Anwendungsschicht. Alle diese Dienste haben Sicherheitsanforderungen wie
openaire +2 more sources
Mit der Verbreitung offener Netze, insbesondere des Internets, fand auch die Gruppenkommunikation eine rasante Verbreitung. Eine Vielzahl heutiger Protokolle sind gruppen-orientiert: angefangen bei Multicast-Diensten in der Netzwerkschicht bis hin zu Videokonferenzsystemen auf der Anwendungsschicht. Alle diese Dienste haben Sicherheitsanforderungen wie
openaire +2 more sources

