Sciweavers

241 search results - page 33 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
IACR
2011
137views more  IACR 2011»
12 years 7 months ago
Lightweight Anonymous Authentication with TLS and DAA for Embedded Mobile Devices
Although anonymous authentication has been extensively studied, so far no scheme has been widely adopted in practice. A particular issue with fully anonymous authentication schemes...
Liqun Chen, Kurt Dietrich, Hans Löhr, Ahmad-R...
CJ
2006
123views more  CJ 2006»
13 years 7 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 27 days 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
EUROCRYPT
2007
Springer
13 years 11 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin