Search

Your search keyword '"Zanella-Béguelin, Santiago"' showing total 3 results
Start Over Author "Zanella-Béguelin, Santiago" Topic random oracle model
3 results on '"Zanella-Béguelin, Santiago"'

1. Programming Language Techniques for Cryptographic Proofs

Author

Barthe, Gilles, Grégoire, Benjamin, Zanella Béguelin, Santiago, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kaufmann, Matt, editor, and Paulson, Lawrence C., editor

Published
2010
Full Text
View/download PDF

2. Formal Certification of ElGamal Encryption : A Gentle Introduction to CertiCrypt

Author

Barthe, Gilles, Grégoire, Benjamin, Heraud, Sylvain, Zanella Béguelin, Santiago, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Degano, Pierpaolo, editor, Guttman, Joshua, editor, and Martinelli, Fabio, editor

Published
2009
Full Text
View/download PDF

3. Verified indifferentiable hashing into elliptic curves.

Author

Barthe, Gilles, Grégoire, Benjamin, Heraud, Sylvain, Olmedo, Federico, and Zanella-Béguelin, Santiago

Subjects
CRYPTOGRAPHY research, ELLIPTIC curves, DATA encryption, COMPUTER network security, COMPUTER security research
Abstract

Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain (e.g. bitstrings) onto uniformly and independently distributed points in a curve. When implementing such systems, and in order for the proof to carry over to the implementation, those mappings must be instantiated with concrete constructions whose behavior does not deviate significantly from random oracles. In contrast to other approaches to public-key cryptography, where candidates to instantiate random oracles have been known for some time, the first generic construction for hashing into ordinary elliptic curves indifferentiable from a random oracle was put forward only recently by Brier et al. We present a machine-checked proof of this construction. The proof is based on an extension of the CertiCrypt framework with logics and mechanized tools for reasoning about approximate forms of observational equivalence, and integrates mathematical libraries of group theory and elliptic curves. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results