Sciweavers

44 search results - page 7 / 9
» Formal Proof of Provable Security by Game-Playing in a Proof...
Sort
View
EGCDMAS
2004
147views ECommerce» more  EGCDMAS 2004»
13 years 10 months ago
Should We Prove Security Policies Correct?
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
Sebastiano Battiato, Giampaolo Bella, Salvatore Ri...
IJNSEC
2006
122views more  IJNSEC 2006»
13 years 8 months ago
A Directed Signature Scheme Based on RSA Assumption
A directed signature scheme allows a designated verifier to directly verify a signature issued to him, and a third party to check the signature validity with the help of the signe...
Rongxing Lu, Zhenfu Cao
TYPES
2004
Springer
14 years 1 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
TPHOL
2008
IEEE
14 years 2 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
14 years 23 days ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro