Sciweavers

222 search results - page 21 / 45
» How to Forget a Secret
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
ESOP
2003
Springer
15 years 3 months ago
On the Secure Implementation of Security Protocols
We consider the problem of implementing a security protocol in such a manner that secrecy of sensitive data is not jeopardized. Implementation is assumed to take place in the cont...
Pablo Giambiagi, Mads Dam
FC
1999
Springer
160views Cryptology» more  FC 1999»
15 years 2 months ago
Anonymous Authentication of Membership in Dynamic Groups
Abstract. We present a series of protocols for authenticating an individual’s membership in a group without revealing that individual’s identity and without restricting how the...
Stuart E. Schechter, Todd Parnell, Alexander J. Ha...
MAS
1998
Springer
172views Communications» more  MAS 1998»
15 years 2 months ago
Protecting Mobile Agents Against Malicious Hosts
A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under...
Tomas Sander, Christian F. Tschudin
ACNS
2006
Springer
167views Cryptology» more  ACNS 2006»
15 years 1 months ago
Public Key Cryptography Sans Certificates in Ad Hoc Networks
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
Nitesh Saxena