608 search results - page 46 / 122 » Interactive Oracle Proofs |
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
APAL
2010
13 years 10 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
ECCC
2010
13 years 8 months ago
2010
We investigate the problem of local reconstruction, as deļ¬ned by Saks and Seshadhri (2008), in the context of error correcting codes. The ļ¬rst problem we address is that of me...
TCC
2012
Springer
12 years 5 months ago
2012
Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
PKC
2012
Springer
12 years 9 days ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography ā PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...