Sciweavers

5550 search results - page 358 / 1110
» Different Approaches to Proof Systems
Sort
View
EUROCRYPT
1998
Springer
15 years 11 months ago
Strengthened Security for Blind Signatures
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
David Pointcheval
KBSE
1997
IEEE
15 years 11 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
TAPSOFT
1997
Springer
15 years 11 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
CSFW
2009
IEEE
15 years 10 months ago
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
Karthikeyan Bhargavan, Ricardo Corin, Pierre-Malo ...
KR
2000
Springer
15 years 10 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil