Sciweavers

216 search results - page 18 / 44
» Formal Proofs for the Security of Signcryption
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
CCS
2009
ACM
15 years 4 months ago
HAIL: a high-availability and integrity layer for cloud storage
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
Kevin D. Bowers, Ari Juels, Alina Oprea
SIGSOFT
2003
ACM
15 years 10 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
SBMF
2010
Springer
132views Formal Methods» more  SBMF 2010»
14 years 4 months ago
Midlet Navigation Graphs in JML
Abstract. In the context of the EU project Mobius on Proof Carrying Code for Java programs (midlets) on mobile devices, we present a way to express midlet navigation graphs in JML....
Wojciech Mostowski, Erik Poll
SPE
2011
14 years 4 months ago
Decomposition tool for event-B
Abstract. Two methods have been identified for Event-B model decomposition: shared variable and shared event. The purpose of this paper is to introduce the two approaches and the ...
Renato Silva, Carine Pascal, Thai Son Hoang, Micha...