Certified Synthesis of Efficient Batch Verifiers

Joseph A. Akinyele 1 Gilles Barthe 2 Benjamin Grégoire 3 Benedikt Schmidt 2 Pierre-Yves Strub 2
1 JHU - Johns Hopkins University
2 Institute IMDEA Software [Madrid]
3 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Many algorithms admit very efficient batch versions that compute simultaneously the output of the algorithms on a set of inputs. Batch algorithms are widely used in cryptography, especially in the setting of pairing-based computations, where they deliver significant speed-ups.
Type de document :
Communication dans un congrès
CSF 2014 - IEEE 27th Computer Security Foundations Symposium, Jul 2014, Vienna, Austria. pp.153 - 165, 2014, 27th Computer Security Foundations Symposium, 2014. 〈10.1109/CSF.2014.19〉
Liste complète des métadonnées
https://hal.inria.fr/hal-01094565
Contributeur : Benjamin Gregoire <>
Soumis le : vendredi 12 décembre 2014 - 15:15:07
Dernière modification le : jeudi 11 janvier 2018 - 16:23:44

Lien texte intégral

openaccess

Identifiants

Collections

INRIA | UNIV-COTEDAZUR

Citation

Joseph A. Akinyele, Gilles Barthe, Benjamin Grégoire, Benedikt Schmidt, Pierre-Yves Strub. Certified Synthesis of Efficient Batch Verifiers. CSF 2014 - IEEE 27th Computer Security Foundations Symposium, Jul 2014, Vienna, Austria. pp.153 - 165, 2014, 27th Computer Security Foundations Symposium, 2014. 〈10.1109/CSF.2014.19〉. 〈hal-01094565〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

246

Contact


archive-ouverte@inria.fr