Sciweavers

2237 search results - page 302 / 448
» On the Security of Random Sources
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
MMMACNS
2005
Springer
15 years 3 months ago
Unique User-Generated Digital Pseudonyms
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
Peter Schartner, Martin Schaffer
CRYPTO
2004
Springer
91views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Non-interactive Timestamping in the Bounded Storage Model
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Inte...
Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
ESORICS
2004
Springer
15 years 3 months ago
Portable and Flexible Document Access Control Mechanisms
We present and analyze portable access control mechanisms for large data repositories, in that the customized access policies are stored on a portable device (e.g., a smart card). ...
Mikhail J. Atallah, Marina Bykova
EUROCRYPT
2004
Springer
15 years 3 months ago
Concurrent Signatures
We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures...
Liqun Chen, Caroline Kudla, Kenneth G. Paterson