Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

3. Secure Computation without Agreement

Yehuda Lindell

Published Jan 1, 2003• 4 citations
Publisher
DOI
10.1007/978-3-540-39819-6_3

Related papers

Secure Computation without Agreement

Shafi Goldwasser, Yehuda Lindell

Lecture notes in computer science•Jan 1, 2002•105 citations

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell

Journal of Cryptology•May 20, 2005•112 citations

A Lightweight Key Agreement Protocol with Authentication Capability

Albert Guan

Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).

International Journal of Foundations of Computer Science•Mar 16, 2021•0 citations

Security Analysis Approaches for Group Key Agreement Protocols

Wei Da-wei

Group Key agreement allows multi users to establish a common session key though insecure channels.Designing secure group key agreement protocols is one of the most fundamental cryptographic tasks.This paper introduced two approaches developed for analyzing security group key agreement protocols:computational complexity approach and formal analysis approach.The key technologies of computational complexity approach were discussed,including the proof technology based on reduction and simulatability,and security models based on reduction and simulatability.The trends in this field were presented.

•Jan 1, 2011•0 citations

Secure Computation

Silvio M. Micali, Phillip Rogaway

Springer eBooks•Aug 11, 2007•153 citations

A Key Agreement of the Improvements Based on Secure two-Party Computation

Junming Zhang

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Journal of Kaili University•Jan 1, 2011•0 citations
Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).
Group Key agreement allows multi users to establish a common session key though insecure channels.Designing secure group key agreement protocols is one of the most fundamental cryptographic tasks.This paper introduced two approaches developed for analyzing security group key agreement protocols:computational complexity approach and formal analysis approach.The key technologies of computational complexity approach were discussed,including the proof technology based on reduction and simulatability,and security models based on reduction and simulatability.The trends in this field were presented.