Sciweavers

757 search results - page 95 / 152
» How secure are secure interdomain routing protocols
Sort
View
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 4 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
HICSS
2002
IEEE
116views Biometrics» more  HICSS 2002»
14 years 26 days ago
E-commerce Security Issues
Without trust, most prudent business operators and clients may decide to forgo use of the Internet and revert back to traditional methods of doing business. To counter this trend,...
Randy C. Marchany, Joseph G. Tront
TCOS
2010
13 years 2 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
FC
2005
Springer
88views Cryptology» more  FC 2005»
14 years 1 months ago
Small Coalitions Cannot Manipulate Voting
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
Edith Elkind, Helger Lipmaa
FC
2009
Springer
134views Cryptology» more  FC 2009»
14 years 2 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes