Sciweavers

719 search results - page 81 / 144
» Proving Security Protocols Correct
Sort
View
ASIACRYPT
2000
Springer
15 years 2 months ago
A Length-Invariant Hybrid Mix
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
Miyako Ohkubo, Masayuki Abe
JCS
2010
124views more  JCS 2010»
14 years 8 months ago
Verifying resource access control on mobile interactive devices
A model of resource access control is presented in which the access control to resources can employ user interaction to obtain the necessary permissions. This model is inspired by...
Frédéric Besson, Guillaume Dufay, Th...
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
15 years 6 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
SPAA
1998
ACM
15 years 2 months ago
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D...
IFIP
2009
Springer
14 years 7 months ago
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers achieve greater security. Proof of possession of authorisation values known as authdata is require...
Liqun Chen, Mark Ryan