Results 1 - 10 of 1,178

Efficient Key Exchange with Tight Security Reduction

by Jiang Wu, Berkant Ustaoglu
"... In this paper, we propose two authenticated key exchange (AKE) protocols, SMEN and SMEN − , which have efficient online computation and tight security proof in the extended Canetti-Krawczyk (eCK) model. SMEN takes 1.25 exponentiations in online computation, close to that (1.17 exponentiations) of th ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In this paper, we propose two authenticated key exchange (AKE) protocols, SMEN and SMEN − , which have efficient online computation and tight security proof in the extended Canetti-Krawczyk (eCK) model. SMEN takes 1.25 exponentiations in online computation, close to that (1.17 exponentiations

Random Key Predistribution Schemes for Sensor Networks”,

by Haowen Chan , Adrian Perrig , Dawn Song - IEEE Symposium on Security and Privacy, , 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract - Cited by 832 (12 self) - Add to MetaCart
Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure

LEAP: Efficient Security Mechanisms for Large-scale Distributed Sensor Networks

by Sencun Zhu , 2003
"... Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node. The design of the protocol is motivated by the observ ..."
Abstract - Cited by 469 (22 self) - Add to MetaCart
by the observation that different types of messages exchanged between sensor nodes have different security requirements, and that a single keying mechanism is not suitable for meeting these different security requirements. LEAP supports the establishment of four types of keys for each sensor node – an individual key

Authentication and Authenticated Key Exchanges

by Whitfield Diffie, Paul C. van Oorschot, Michael J. Wiener , 1992
"... We discuss two-party mutual authentication protocols providing authenticated key exchange, focusing on those using asymmetric techniques. A simple, efficient protocol referred to as the station-to-station (STS) protocol is introduced, examined in detail, and considered in relation to existing protoc ..."
Abstract - Cited by 310 (6 self) - Add to MetaCart
We discuss two-party mutual authentication protocols providing authenticated key exchange, focusing on those using asymmetric techniques. A simple, efficient protocol referred to as the station-to-station (STS) protocol is introduced, examined in detail, and considered in relation to existing

An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction

by Jooyoung Lee, Choon Sik Park , 2008
"... In this paper, we present a new authenticated key exchange(AKE) protocol, called NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle assumption and the gap Diffie-Hellman(GDH) assumption. Our protocol enjoys a simple and tight security reduction compared to th ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
In this paper, we present a new authenticated key exchange(AKE) protocol, called NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle assumption and the gap Diffie-Hellman(GDH) assumption. Our protocol enjoys a simple and tight security reduction compared

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography

by Oded Regev - In STOC , 2005
"... Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear co ..."
Abstract - Cited by 364 (6 self) - Add to MetaCart
code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a quantum algorithm for SVP and SIVP. A main open question is whether this reduction can be made classical. We also present a

Provably secure password-authenticated key exchange using Diffie-Hellman

by Victor Boyko, Philip Mackenzie, Sarvar Patel , 2000
"... Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who ob ..."
Abstract - Cited by 191 (12 self) - Add to MetaCart
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who

Key Agreement in Dynamic Peer Groups

by Michael Steiner, Gene Tsudik, Michael Waidner - IEEE Transactions on Parallel and Distributed Systems , 2000
"... As a result of the increased popularity of grouporiented applications and protocols, group communication occurs in many different settings: from network multicasting to application layer tele- and video-conferencing. Regardless of the application environment, security services are necessary to provi ..."
Abstract - Cited by 213 (18 self) - Add to MetaCart
-Hellman key exchange method. The protocols are efficient and provably secure against passiveadversari...

Plutus: Scalable secure file sharing on untrusted storage

by Mahesh Kallahalla, Erik Riedel, Ram Swaminathan, Qian Wang, Kevin Fu , 2003
"... Plutus is a cryptographic storage system that enables secure file sharing without placing much trust on the file servers. In particular, it makes novel use of cryptographic primitives to protect and share files. Plutus features highly scalable key management while allowing individual users to retain ..."
Abstract - Cited by 229 (2 self) - Add to MetaCart
to retain direct control over who gets access to their files. We explain the mechanisms in Plutus to reduce the number of cryptographic keys exchanged between users by using filegroups, distinguish file read and write access, handle user revocation efficiently, and allow an untrusted server to authorize

On Formal Models for Secure Key Exchange

by Victor Shoup, Victor Shoup , 1999
"... A new formal security model for session key exchange protocols in the public key setting is proposed, and several efficient protocols are analyzed in this model. The relationship between this new model and previously proposed models is explored, and several interesting, subtle distinctions between s ..."
Abstract - Cited by 88 (2 self) - Add to MetaCart
A new formal security model for session key exchange protocols in the public key setting is proposed, and several efficient protocols are analyzed in this model. The relationship between this new model and previously proposed models is explored, and several interesting, subtle distinctions between
Results 1 - 10 of 1,178