Sciweavers

56 search results - page 4 / 12
» Functional Correctness Proofs of Encryption Algorithms
Sort
View
ESORICS
2009
Springer
15 years 10 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
78
Voted
SCP
2008
89views more  SCP 2008»
14 years 9 months ago
A challenge for atomicity verification
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
Wim H. Hesselink
93
Voted
FSE
2003
Springer
123views Cryptology» more  FSE 2003»
15 years 2 months ago
The Security of "One-Block-to-Many" Modes of Operation
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
Henri Gilbert
91
Voted
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
CSL
2010
Springer
14 years 10 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel