Sciweavers

1005 search results - page 46 / 201
» Practical Secure Function Evaluation
Sort
View
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
13 years 6 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
ISVC
2010
Springer
13 years 7 months ago
Reconstruction of Spectra Using Empirical Basis Functions
Physically-based image synthesis requires measured spectral quantities for illuminants and reflectances as part of the virtual scene description to compute trustworthy lighting si...
Jakob Bärz, Tina Hansen, Stefan Müller
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
14 years 9 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
PODC
2004
ACM
14 years 2 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...