Sciweavers

1834 search results - page 179 / 367
» Public Key Cryptography
Sort
View
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 9 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
ACNS
2007
Springer
94views Cryptology» more  ACNS 2007»
14 years 3 months ago
Preventing Collusion Attacks on the One-Way Function Tree (OFT) Scheme
The one-way function tree (OFT) scheme proposed by Balenson et. al is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. ...
Xuxin Xu, Lingyu Wang, Amr M. Youssef, Bo Zhu
FSE
2007
Springer
103views Cryptology» more  FSE 2007»
14 years 3 months ago
Improved Slide Attacks
Abstract. The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on ...
Eli Biham, Orr Dunkelman, Nathan Keller
CHES
2006
Springer
134views Cryptology» more  CHES 2006»
14 years 1 months ago
Read-Proof Hardware from Protective Coatings
In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient beca...
Pim Tuyls, Geert Jan Schrijen, Boris Skoric, Jan v...
ESAS
2004
Springer
14 years 2 months ago
Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Mark Manulis, Jörg Schwenk