Sciweavers

41 search results - page 7 / 9
» Secret Handshakes from Pairing-Based Key Agreements
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
CCS
2003
ACM
13 years 10 months ago
A pairwise key pre-distribution scheme for wireless sensor networks
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Keys for encryption and authentication pu...
Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod ...
NDSS
2008
IEEE
13 years 11 months ago
A New Privacy-Enhanced Matchmaking Protocol
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...
Ji Sun Shin, Virgil D. Gligor
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 9 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
FSE
2003
Springer
123views Cryptology» more  FSE 2003»
13 years 10 months ago
The Security of "One-Block-to-Many" Modes of Operation
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
Henri Gilbert