Sciweavers

5722 search results - page 3 / 1145
» Security Function Interactions
Sort
View
EUROCRYPT
2010
Springer
13 years 9 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
ICC
2009
IEEE
155views Communications» more  ICC 2009»
13 years 3 months ago
On Hashing with Tweakable Ciphers
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...
Raphael Chung-Wei Phan, Jean-Philippe Aumasson
ASIACRYPT
2005
Springer
13 years 11 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
CHI
2011
ACM
12 years 9 months ago
Improving the safety of homeless young people with mobile phones: values, form and function
By their pervasiveness and by being worn on our bodies, mobile phones seem to have become intrinsic to safety. To examine this proposition, 43 participants, from four stakeholder ...
Jill Palzkill Woelfer, Amy Iverson, David G. Hendr...