Sciweavers

310 search results - page 24 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
74
Voted
AINA
2005
IEEE
15 years 3 months ago
Secure One-Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
Chu-Hsing Lin, Hsiu-Hsia Lin
97
Voted
TC
2008
14 years 9 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park
PROVSEC
2009
Springer
15 years 4 months ago
GUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Yuan Tian, Hao Zhang
USS
2010
14 years 7 months ago
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
Sarah Meiklejohn, C. Christopher Erway, Alptekin K...
PERCOM
2010
ACM
14 years 8 months ago
Security analysis of reliable transport layer protocols for wireless sensor networks
End-to-end reliability of communications is an important requirement in many applications of wireless sensor networks. For this reason, a number of reliable transport protocols sp...
Levente Buttyán, L. Csik