Sciweavers

90 search results - page 17 / 18
» Pairings for cryptographers
Sort
View
ICC
2009
IEEE
130views Communications» more  ICC 2009»
13 years 4 months ago
Verification of Secret Key Generation from UWB Channel Observations
Theoretical models of ultrawideband (UWB) radio channels indicate that pairs of UWB radio transceivers measure their common radio channel with a high degree of agreement and third ...
Masoud Ghoreishi Madiseh, Shuai He, Michael L. McG...
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
14 years 13 days ago
Generic Transformation to Strongly Unforgeable Signatures
Recently, there are several generic transformation techniques proposed for converting unforgeable signature schemes (the message in the forgery has not been signed yet) into strong...
Qiong Huang, Duncan S. Wong, Yiming Zhao
ASPLOS
1998
ACM
13 years 10 months ago
A Cost-Effective, High-Bandwidth Storage Architecture
This paper describes the Network-Attached Secure Disk (NASD) storage architecture, prototype implementations of NASD drives, array management for our architecture, and three files...
Garth A. Gibson, David Nagle, Khalil Amiri, Jeff B...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin