Sciweavers

521 search results - page 30 / 105
» Scalable Secure Multiparty Computation
Sort
View
ESORICS
2005
Springer
14 years 1 months ago
On Scalability and Modularisation in the Modelling of Network Security Systems
Abstract. As the use of computers and data communication technologies spreads, network security systems are becoming increasingly complex, due to the incorporation of a variety of ...
João Porto de Albuquerque, Heiko Krumm, Pau...
CCS
2010
ACM
13 years 8 months ago
Accountability: definition and relationship to verifiability
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
ASIACRYPT
2008
Springer
13 years 9 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
SIAMCOMP
2011
13 years 2 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...