Sciweavers

264 search results - page 3 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
CRYPTO
1999
Springer
87views Cryptology» more  CRYPTO 1999»
13 years 9 months ago
Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier
Mihir Bellare, Oded Goldreich, Hugo Krawczyk
ESAS
2006
Springer
13 years 9 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 5 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
EUROCRYPT
1999
Springer
13 years 9 months ago
Software Performance of Universal Hash Functions
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
Wim Nevelsteen, Bart Preneel