87 search results - page 2 / 18 » A Verifiable Random Function with Short Proofs and Keys |
POPL
2010
ACM
14 years 3 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
ESORICS
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
CTRSA
2009
Springer
14 years 13 days ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...