Sciweavers

38 search results - page 5 / 8
» Dining Cryptographers Revisited
Sort
View
ENTCS
2007
89views more  ENTCS 2007»
13 years 9 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
14 years 1 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
14 years 1 months ago
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
John Black
IJNSEC
2008
92views more  IJNSEC 2008»
13 years 9 months ago
Re-visiting the One-Time Pad
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
Nithin Nagaraj, Vivek Vaidya, Prabhakar G. Vaidya
IJNSEC
2008
113views more  IJNSEC 2008»
13 years 9 months ago
Multi-Designated Verifiers Signatures Revisited
Multi-Designated Verifier Signatures (MDVS) are privacy-oriented signatures that can only be verified by a set of users specified by the signer. We propose two new generic constru...
Sherman S. M. Chow