Sciweavers

719 search results - page 5 / 144
» Proving Security Protocols Correct
Sort
View
VLDB
2007
ACM
115views Database» more  VLDB 2007»
15 years 9 months ago
NS2: Networked Searchable Store with Correctness
In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequen...
Radu Sion, Sumeet Bajaj, Bogdan Carbunar, Stefan K...
CCS
2007
ACM
15 years 3 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
IFIP
2009
Springer
14 years 7 months ago
On the Automated Correction of Protocols with Improper Message Encoding
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...
Dieter Hutter, Raul Monroy
CSFW
2010
IEEE
15 years 27 days ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
IEEEARES
2008
IEEE
15 years 4 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma