Sciweavers

216 search results - page 41 / 44
» Formal Proofs for the Security of Signcryption
Sort
View
WWW
2007
ACM
14 years 8 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
POPL
2007
ACM
14 years 7 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
ESOP
2010
Springer
14 years 4 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
TPHOL
2009
IEEE
14 years 2 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
14 years 20 days ago
On Deniability in the Common Reference String and Random Oracle Model
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
Rafael Pass