Sciweavers

273 search results - page 28 / 55
» Modular Security Proofs for Key Agreement Protocols
Sort
View
TACAS
2007
Springer
158views Algorithms» more  TACAS 2007»
15 years 5 months ago
Automatic Analysis of the Security of XOR-Based Key Management Schemes
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
Véronique Cortier, Gavin Keighren, Graham S...
IPPS
2003
IEEE
15 years 5 months ago
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
Siddika Berna Örs, Lejla Batina, Bart Preneel...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
JOC
2007
133views more  JOC 2007»
14 years 11 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
CCS
2010
ACM
14 years 9 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin