285 search results - page 12 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
IFIP
2009
Springer
13 years 5 months ago
2009
Springer
Security protocols are crucial to achieve trusted computing. However, designing security protocols is not easy and so security protocols are typically faulty and have to be repaire...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...