Sciweavers

285 search results - page 22 / 57
» Computationally Sound, Automated Proofs for Security Protoco...
Sort
View
JAR
1998
134views more  JAR 1998»
13 years 7 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
ICICS
2010
Springer
13 years 5 months ago
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The main reason for constructing sealed-bid auction prot...
Mehrdad Nojoumian, Douglas R. Stinson
CN
2006
117views more  CN 2006»
13 years 7 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 1 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh