Sciweavers

106 search results - page 7 / 22
» Optimistic Fair Secure Computation
Sort
View
CSFW
2007
IEEE
14 years 4 months ago
LTL Model Checking for Security Protocols
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability...
Alessandro Armando, Roberto Carbone, Luca Compagna
CCS
2011
ACM
12 years 9 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
14 years 1 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
ICDCS
2006
IEEE
14 years 3 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
FOCS
2010
IEEE
13 years 7 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai