Sciweavers

310 search results - page 12 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
ICISC
2008
103views Cryptology» more  ICISC 2008»
14 years 11 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
CCS
2008
ACM
14 years 11 months ago
FairplayMP: a system for secure multi-party computation
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
Assaf Ben-David, Noam Nisan, Benny Pinkas
82
Voted
AINA
2006
IEEE
15 years 3 months ago
Property-Based Taming of Lying Mobile Nodes
Intelligent security protocols can verify whether the involved principals have properties that are defined based on certain functional and security policies. The property we focu...
Mark Manulis, Ahmad-Reza Sadeghi
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
15 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
101
Voted
SCN
2008
Springer
14 years 9 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström