Sciweavers

3504 search results - page 60 / 701
» Secure protocol composition
Sort
View
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
15 years 2 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
15 years 3 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
IJISEC
2008
101views more  IJISEC 2008»
14 years 9 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
IJNSEC
2007
115views more  IJNSEC 2007»
14 years 9 months ago
Novel Secure Communication Protocol for Conditional Access System
A protocol for secure communication between set-top box and smart card in conditional access system is proposed. The proposed protocol uses the Schnorr identification scheme to a...
Yongliang Liu, Xiaolin Yang, Hongxun Yao, Wen Gao
COMCOM
2000
97views more  COMCOM 2000»
14 years 9 months ago
Verification of security protocols using LOTOS-method and application
We explain how the formal language LOTOS can be used to specify security protocols and cryptographic operations. We describe how security properties can be modelled as safety prop...
Guy Leduc, François Germeau