Sciweavers

27 search results - page 5 / 6
» Biased Bit Commitment and Applications
Sort
View
JOC
2011
104views more  JOC 2011»
12 years 9 months ago
On the Security of Oscillator-Based Random Number Generators
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
Mathieu Baudet, David Lubicz, Julien Micolod, Andr...
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 12 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
13 years 12 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
CORR
2002
Springer
96views Education» more  CORR 2002»
13 years 6 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 4 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena