20 search results - page 4 / 4 » The Rabin cryptosystem revisited |
FOSSACS
2009
Springer
14 years 2 days ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
ESAS
2004
Springer
13 years 10 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have incon...
CTRSA
2007
Springer
13 years 11 months ago
2007
Springer
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...