285 search results - page 38 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
ICECCS
2005
IEEE
14 years 1 months ago
2005
IEEE
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
PKC
2000
Springer
13 years 11 months ago
2000
Springer
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
CRYPTO
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
INFORMATICALT
2007
13 years 7 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...