370 search results - page 37 / 74 » Limits of Constructive Security Proofs |
AMAST
2000
Springer
14 years 14 days ago
2000
Springer
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
CRYPTO
2007
Springer
14 years 2 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}...
ESORICS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce the notion of sanitizable signatures that offer many attractive security features for certain current and emerging applications. A sanitizable signature allows author...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...