Sciweavers

264 search results - page 6 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
ASIACRYPT
2005
Springer
14 years 3 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
IACR
2011
97views more  IACR 2011»
12 years 9 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
PPSN
2010
Springer
13 years 8 months ago
Privacy-Preserving Multi-Objective Evolutionary Algorithms
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...
Daniel Funke, Florian Kerschbaum
FSE
2011
Springer
263views Cryptology» more  FSE 2011»
13 years 1 months ago
Practical Near-Collisions on the Compression Function of BMW
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
Gaëtan Leurent, Søren S. Thomsen
MOC
2010
13 years 4 months ago
On the numerical evaluation of Fredholm determinants
Some significant quantities in mathematics and physics are most naturally expressed as the Fredholm determinant of an integral operator, most notably many of the distribution funct...
Folkmar Bornemann