Sciweavers

719 search results - page 96 / 144
» Proving Security Protocols Correct
Sort
View
JCS
2010
121views more  JCS 2010»
14 years 8 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
JOC
2000
181views more  JOC 2000»
14 years 9 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
FC
2009
Springer
134views Cryptology» more  FC 2009»
15 years 4 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes
ASIACRYPT
2009
Springer
15 years 4 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
FC
2010
Springer
205views Cryptology» more  FC 2010»
15 years 1 months ago
On Robust Key Agreement Based on Public Key Authentication
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
Feng Hao