876 search results - page 19 / 176 » Limits on the Usefulness of Random Oracles |
155
click to vote
ISPEC
2005
Springer
15 years 12 months ago
2005
Springer
Token-controlled public key encryption (TCPKE) schemes, introduced in [1], offer many possibilities of application in financial or legal scenarios. Roughly speaking, in a TCPKE s...
161
click to vote
IJNSEC
2006
15 years 6 months ago
2006
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...
155
click to vote
BSL
2005
15 years 6 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
161
click to vote
TRUST
2010
Springer
15 years 11 months ago
2010
Springer
Direct Anonymous Attestation (DAA) is an anonymous signature scheme designed for anonymous attestation of a Trusted Platform Module (TPM) while preserving the privacy of the devic...
175
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...