Sciweavers

285 search results - page 31 / 57
» Computationally Sound, Automated Proofs for Security Protoco...
Sort
View
KR
1994
Springer
13 years 11 months ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty
CCS
2004
ACM
14 years 1 months ago
Authenticity by tagging and typing
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
AI
2000
Springer
13 years 7 months ago
Proving theorems by reuse
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
Christoph Walther, Thomas Kolbe
AISC
1998
Springer
13 years 12 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
14 years 1 months ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung