Sciweavers

127 search results - page 17 / 26
» Proving Properties of Security Protocols by Induction
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
14 years 9 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
15 years 4 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
CSFW
2002
IEEE
15 years 2 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
ICC
2007
IEEE
169views Communications» more  ICC 2007»
15 years 4 months ago
Secure Vehicular Communications Based on Group Signature and ID-Based Signature Scheme
—Vehicular communication networking is a promising approach of facilitating road safety, traffic management, and infotainment dissemination for drivers and passengers. However, i...
Xiaoting Sun, Xiaodong Lin, Pin-Han Ho
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 1 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo