Sciweavers

1777 search results - page 148 / 356
» Programming Cryptographic Protocols
Sort
View
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
15 years 5 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
EUROCRYPT
2006
Springer
15 years 5 months ago
Composition Implies Adaptive Security in Minicrypt
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Krzysztof Pietrzak
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
15 years 5 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
ACSAC
2001
IEEE
15 years 5 months ago
Why Information Security is Hard-An Economic Perspective
According to one common view, information security comes down to technical measures. Given better access control policy models, formal proofs of cryptographic protocols, approved ...
Ross J. Anderson
ACSAC
2003
IEEE
15 years 5 months ago
Scalable and Efficient PKI for Inter-Organizational Communication
We propose an efficient and flexible system for a secure and authentic data exchange in a multiinstitutional environment, where the institutions maintain different databases and p...
Arne Ansper, Ahto Buldas, Margus Freudenthal, Jan ...