Sciweavers

292 search results - page 5 / 59
» Communication and Round Efficient Information Checking Proto...
Sort
View
IJISEC
2006
108views more  IJISEC 2006»
13 years 7 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
IANDC
2008
128views more  IANDC 2008»
13 years 7 months ago
Rule-based static analysis of network protocol implementations
Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attack...
Octavian Udrea, Cristian Lumezanu, Jeffrey S. Fost...
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 8 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
JUCS
2008
156views more  JUCS 2008»
13 years 7 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng