IRIS Research product catalog (Sapienza University of Rome) · 2007 · 100 citations · 22 references
ComputingComputer ScienceCybersecurityAuthenticationCryptographySecurity ProtocolsAuthentication ProtocolsCryptographic ProtocolsHandshake ProtocolsKey Exchange ProtocolsMutual AuthenticationPrivacy-preserving ProtocolsCommunication PrivacyGroup Key AgreementKey ExchangeMatchingMutual Authentication In Key ExchangePrivacy-preserving AuthenticationSecure Authentication ProtocolsSecure Group Communication
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have become critical primitives in building secure distributed systems. Secret handshakes provide such a service by allowing two members of the same group to secretly and privately authenticate to each other and agree on a shared key for further communication. This paper presents the first efficient secret handshake schemes with unlinkable, reusable credentials that do not rely on random oracles for their security (solving open problems from prior literature). In previous work, secret handshakes were extended with roles, so that a group member A can specify the role another group member B must have in order to successfully complete the protocol with A. We generalize the traditional and role-based secret handshake in two ways. First, we present a secret handshake with dynamic matching, in which each party can specify both the group and the role the other must have in order to complete the handshake. Second, we provide a novel extension of secret handshakes to include attributes, allowing the handshake to be based on approximate (or fuzzy) matching. We demonstrate the practicality and efficiency of our protocols by evaluating a prototype implementation. We integrate our dynamic matching protocol into IPsec, and we detail the performance tradeoffs associated with our fuzzy matching scheme. Our experiments indicate that our solutions offer attractive performance. Supported in part by NSF. Supported by Intel Ph.D. fellowship.
22
Identity-Based Encryption from the Weil Pairing
Dan Boneh, Matthew Franklin · SIAM Journal on Computing · 2003 · 3.6K citations
Protocols for secure computations
Andrew Chi-Chih Yao · Foundations of Computer Science · 1982 · 2.7K citations
Tools for privacy preserving distributed data mining
Chris Clifton, Murat Kantarcıoğlu, Jaideep Vaidya et al. · ACM SIGKDD Explorations Newsletter · 2002 · 890 citations
Fairplay—a secure two-party computation system
Dahlia Malkhi, Noam Nisan, Benny Pinkas et al. · 2004 · 782 citations
Information sharing across private databases
Rakesh Agrawal, Alexandre Evfimievski, Ramakrishnan Srikant · 2003 · 638 citations