167 search results - page 2 / 34 » Comparing Two Notions of Simulatability |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
IANDC
2007
13 years 5 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
CRYPTO
1999
Springer
13 years 9 months ago
1999
Springer
We prove the equivalence of two definitions of non-malleable encryption appearing in the literature— the original one of Dolev, Dwork and Naor and the later one of Bellare, Desa...
BPM
2006
Springer
13 years 9 months ago
2006
Springer
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service match...