Sciweavers

1058 search results - page 75 / 212
» Secure Group Communications Using Key Graphs
Sort
View
112
Voted
ACSAC
2010
IEEE
15 years 11 days ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...
112
Voted
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
15 years 8 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
ICCSA
2007
Springer
15 years 8 months ago
An Enhanced One-Round Pairing-Based Tripartite Authenticated Key Agreement Protocol
A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three specific entities in communicating over an open network with a shared secre...
Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae L...
ISPDC
2010
IEEE
15 years 24 days ago
SKAIT: A Parameterized Key Assignment Scheme for Wireless Networks
—In this paper, we propose SKAIT, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wirele...
Ramon Novales, Neeraj Mittal, Kamil Saraç
ACNS
2004
Springer
156views Cryptology» more  ACNS 2004»
15 years 7 months ago
One-Round Protocols for Two-Party Authenticated Key Exchange
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee