2432 search results - page 72 / 487 » Cryptographic logical relations |
139
click to vote
ACNS
2011
Springer
14 years 1 months ago
2011
Springer
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
The probability of a property on the collection of all finite relational structures is the limit as
TCC
2009
Springer
15 years 10 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...
106
click to vote
ASIACRYPT
2011
Springer
13 years 10 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...