Sciweavers

3115 search results - page 249 / 623
» Synthesizing Secure Protocols
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
ICCSA
2007
Springer
15 years 11 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...
145
Voted
MDAI
2005
Springer
15 years 11 months ago
One-Way and Two-Party Authenticated ID-Based Key Agreement Protocols Using Pairing
Cryptography is the ancient science of encrypting messages so that only the sender and receiver can recover them. To achieve this goal, an agreed key between the sender and receive...
Takeshi Okamoto, Raylin Tso, Eiji Okamoto
152
Voted
ACSAC
1999
IEEE
15 years 10 months ago
Modular Fair Exchange Protocols for Electronic Commerce
Recently, research has focused on enabling fair exchange between payment and electronically shipped items. The reason for this is the growing importance of Electronic Commerce and...
Holger Vogt, Henning Pagnia, Felix C. Gärtner
CCS
2009
ACM
16 years 6 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria