Benjamin Grégoire
Applied Filters
- Benjamin Grégoire
- AuthorRemove filter
People
Colleagues
- Benjamin Grégoire (75)
- Gilles Barthe (58)
- Pierre Yves Strub (18)
- Santiago Zanella-Béguelin (14)
- Manuel Bernardo Barbosa (10)
- César Kunz (7)
- François Dupressoir (7)
- Vincent Laporte (7)
- Justin Hsu (6)
- Sylvain Heraud (6)
- José Bacelar Almeida (5)
- Laurent Théry (5)
- Pierre Alain Fouque (5)
- Benedikt Schmidt (4)
- Santiago Zanella Béguelin (4)
- Federico Olmedo (3)
- Jorge Luis Sacchini (3)
- Thomas Espitau (3)
- Xavier Leroy (3)
- Yassine Lakhnech (3)
Roles
Publication
Proceedings/Book Names
- CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (3)
- Advances in Cryptology – CRYPTO 2023 (2)
- CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2)
- CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (2)
- CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (2)
- CPP'11: Proceedings of the First international conference on Certified Programs and Proofs (2)
- ITP'10: Proceedings of the First international conference on Interactive Theorem Proving (2)
- Advances in Cryptology – CRYPTO 2024 (1)
- CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (1)
- CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (1)
- CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (1)
- CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (1)
- CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (1)
- Computer Security – ESORICS 2019 (1)
- CPP 2023: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs (1)
- LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (1)
- PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (1)
- POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1)
- POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1)
- POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- Article
Formally Verifying Kyber: Episode V: Machine-Checked IND-CCA Security and Correctness of ML-KEM in EasyCrypt
- José Bacelar Almeida
https://ror.org/037wpkx04Universidade do Minho, Braga, Portugal
INESC TEC, Porto, Portugal
, - Santiago Arranz Olmos
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
, - Manuel Barbosa
INESC TEC, Porto, Portugal
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
https://ror.org/043pwc612University of Porto (FCUP), Porto, Portugal
, - Gilles Barthe
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
https://ror.org/04xvfkh51IMDEA Software Institute, Madrid, Spain
, - François Dupressoir
https://ror.org/0524sp257University of Bristol, Bristol, UK
, - Benjamin Grégoire
https://ror.org/019tgvf94Université Côte d’Azur, Inria, Nice, France
, - Vincent Laporte
https://ror.org/04vfs2w97Université de Lorraine, CNRS, Inria, LORIA, Nancy, France
, - Jean-Christophe Léchenet
https://ror.org/019tgvf94Université Côte d’Azur, Inria, Nice, France
, - Cameron Low
https://ror.org/0524sp257University of Bristol, Bristol, UK
, - Tiago Oliveira
https://ror.org/028zdr819SandboxAQ, Tarrytown, USA
, - Hugo Pacheco
INESC TEC, Porto, Portugal
https://ror.org/043pwc612University of Porto (FCUP), Porto, Portugal
, - Miguel Quaresma
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
, - Peter Schwabe
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
Radboud University, Nijmegen, The Netherlands
, - Pierre-Yves Strub
PQShield, Paris, France
Advances in Cryptology – CRYPTO 2024•August 2024, pp 384-421• https://doi.org/10.1007/978-3-031-68379-4_12AbstractWe present a formally verified proof of the correctness and IND-CCA security of ML-KEM, the Kyber-based Key Encapsulation Mechanism (KEM) undergoing standardization by NIST. The proof is machine-checked in EasyCrypt and it includes: 1) A ...
- 0Citation
MetricsTotal Citations0
- José Bacelar Almeida
- research-articleOpen AccessPublished By ACMPublished By ACM
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs
- Martin Avanzini
Centre Inria d?Université Côte d?Azur, Sophia-Antipolis, France
, - Gilles Barthe
MPI-SP, Bochum, Germany / IMDEA Software Institute, Madrid, Spain
, - Benjamin Grégoire
Centre Inria d?Université Côte d?Azur, Sophia-Antipolis, France
, - Georg Moser
University of Innsbruck, Innsbruck, Austria
, - Gabriele Vanoni
Centre Inria d?Université Côte d?Azur, Sophia-Antipolis, France
Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA1•April 2024, Article No.: 122, pp 784-809 • https://doi.org/10.1145/3649839We propose, implement, and evaluate a hopping proof approach for proving expectation-based properties of probabilistic programs. Our approach combines EHL, a syntax-directed proof system for reducing proof goals of a program to proof goals of simpler ...
- 1Citation
- 319
- Downloads
MetricsTotal Citations1Total Downloads319Last 12 Months319Last 6 weeks75
- Martin Avanzini
- research-article
Masking the GLP Lattice-Based Signature Scheme at Any Order
- Gilles Barthe
MPI-SP, Bochum, Germany
https://ror.org/04xvfkh51IMDEA Software Institute, Madrid, Spain
, - Sonia Belaïd
https://ror.org/0030xrh72CryptoExperts, Paris, France
, - Thomas Espitau
PQShield SAS, Paris, France
, - Pierre-Alain Fouque
https://ror.org/015m7wh34Université de Rennes, Rennes, France
, - Benjamin Grégoire
Inria Sophia Antipolis, Valbonne, France
, - Mélissa Rossi
ANSSI, Paris, France
, - Mehdi Tibouchi
NTT Social Informatics Laboratories, Tokyo, Japan
Journal of Cryptology, Volume 37, Issue 1•Jan 2024 • https://doi.org/10.1007/s00145-023-09485-zAbstractRecently, numerous physical attacks have been demonstrated against lattice-based schemes, often exploiting their unique properties such as the reliance on Gaussian distributions, rejection sampling and FFT-based polynomial multiplication. As the ...
- 0Citation
MetricsTotal Citations0
- Gilles Barthe
- Article
Machine-Checked Security for as in RFC 8391 and
- Manuel Barbosa
https://ror.org/043pwc612University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - François Dupressoir
https://ror.org/0524sp257University of Bristol, Bristol, UK
, - Benjamin Grégoire
https://ror.org/019tgvf94Université Côte d’Azur, Inria, Sophia Antipolis, France
, - Andreas Hülsing
https://ror.org/02c2kyt77Eindhoven University of Technology, Eindhoven, The Netherlands
, - Matthias Meijers
https://ror.org/02c2kyt77Eindhoven University of Technology, Eindhoven, The Netherlands
, - Pierre-Yves Strub
Meta, Paris, France
Advances in Cryptology – CRYPTO 2023•August 2023, pp 421-454• https://doi.org/10.1007/978-3-031-38554-4_14AbstractThis work presents a novel machine-checked tight security proof for —a stateful hash-based signature scheme that is (1) standardized in RFC 8391 and NIST SP 800-208, and (2) employed as a primary building block of , one of the signature schemes ...
- 1Citation
MetricsTotal Citations1
- Manuel Barbosa
- Article
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium
- Manuel Barbosa
https://ror.org/043pwc612University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - Gilles Barthe
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
, - Christian Doczkal
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
, - Jelle Don
https://ror.org/00x7ekv49Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
, - Serge Fehr
https://ror.org/00x7ekv49Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
https://ror.org/027bh9e22Leiden University, Leiden, The Netherlands
, - Benjamin Grégoire
Inria Centre at Université Côte d’Azur, Valbonne, France
, - Yu-Hsuan Huang
https://ror.org/00x7ekv49Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
, - Andreas Hülsing
https://ror.org/02c2kyt77Eindhoven University of Technology, Eindhoven, The Netherlands
, - Yi Lee
https://ror.org/00bj0r217Max Planck Institute for Security and Privacy, Bochum, Germany
https://ror.org/047s2c258University of Maryland, College Park, USA
, - Xiaodi Wu
https://ror.org/047s2c258University of Maryland, College Park, USA
Advances in Cryptology – CRYPTO 2023•August 2023, pp 358-389• https://doi.org/10.1007/978-3-031-38554-4_12AbstractWe extend and consolidate the security justification for the Dilithium signature scheme. In particular, we identify a subtle but crucial gap that appears in several ROM and QROM security proofs for signature schemes that are based on the Fiat-...
- 7Citation
MetricsTotal Citations7
- Manuel Barbosa
- research-articlePublished By ACMPublished By ACM
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
- Manuel Barbosa
University of Porto (FCUP) & INESC TEC
, - Gilles Barthe
MPI-SP and IMDEA Software Institute
, - Benjamin Grégoire
Inria & Université Côte d’Azur
, - Adrien Koutsos
Inria
, - Pierre-Yves Strub
Meta
ACM Transactions on Privacy and Security, Volume 26, Issue 3•August 2023, Article No.: 41, pp 1-34 • https://doi.org/10.1145/3589962In this work, we enhance the EasyCrypt proof assistant to reason about the computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial ...
- 0Citation
- 146
- Downloads
MetricsTotal Citations0Total Downloads146Last 12 Months59Last 6 weeks7
- Manuel Barbosa
- research-articlePublished By ACMPublished By ACM
Practical and Sound Equality Tests, Automatically: Deriving eqType Instances for Jasmin’s Data Types with Coq-Elpi
- Benjamin Grégoire
Université Côte d’Azur, France / Inria, France
, - Jean-Christophe Léchenet
Université Côte d’Azur, France / Inria, France
, - Enrico Tassi
Université Côte d’Azur, France / Inria, France
CPP 2023: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs•January 2023, pp 167-181• https://doi.org/10.1145/3573105.3575683In this paper we describe the design and implementation of feqb, a tool that synthesizes sound equality tests for inductive data types in the dependent type theory of the Coq system. Our procedure scales to large inductive data types, as in hundreds ...
- 2Citation
- 55
- Downloads
MetricsTotal Citations2Total Downloads55Last 12 Months3
- Benjamin Grégoire
- research-articleOpen AccessPublished By ACMPublished By ACM
Enforcing Fine-grained Constant-time Policies
- Basavesh Ammanaghatta Shivakumar
MPI-SP, Bochum, Germany
, - Gilles Barthe
MPI-SP & IMDEA Software Institute, Bochum, Germany
, - Benjamin Grégoire
Inria & Université Côte d'Azur, Sophia-Antipolis, France
, - Vincent Laporte
Université de Lorraine & CNRS & Inria & LORIA, Nancy, France
, - Swarn Priya
Université Côte d'Azur & Inria, Sophia-Antipolis, France
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security•November 2022, pp 83-96• https://doi.org/10.1145/3548606.3560689Cryptographic constant-time (CT) is a popular programming discipline used by cryptographic libraries to protect themselves against timing attacks. The CT discipline aims to enforce that program execution does not leak secrets, where leakage is defined by ...
- 4Citation
- 893
- Downloads
MetricsTotal Citations4Total Downloads893Last 12 Months224Last 6 weeks42
- Basavesh Ammanaghatta Shivakumar
- research-articlePublic AccessPublished By ACMPublished By ACM
Structured Leakage and Applications to Cryptographic Constant-Time and Cost
- Gilles Barthe
MPI-SP & IMDEA Software Institute, Bochum, Germany
, - Benjamin Grégoire
Université Côte d'Azur, Inria, Valbonne, France
, - Vincent Laporte
Université de Lorraine, CNRS, Inria, LORIA, F-54000, Villers-lès-Nancy, France
, - Swarn Priya
Université Côte d'Azur, Inria, Valbonne, France
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security•November 2021, pp 462-476• https://doi.org/10.1145/3460120.3484761Many security properties of interest are captured by instrumented semantics that model the functional behavior and the leakage of programs. For several important properties, including cryptographic constant-time (CCT), leakage models are sufficiently ...
- 4Citation
- 507
- Downloads
MetricsTotal Citations4Total Downloads507Last 12 Months157Last 6 weeks36
- Gilles Barthe
- research-articleOpen AccessPublished By ACMPublished By ACM
EasyPQC: Verifying Post-Quantum Cryptography
- Manuel Barbosa
University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - Gilles Barthe
MPI-SP and IMDEA Software Institute, Bochum, Germany
, - Xiong Fan
Algorand, Inc., Boston, MA, USA
, - Benjamin Grégoire
INRIA, Sophia-Antipolis, France
, - Shih-Han Hung
University of Texas, Austin, TX, USA
, - Jonathan Katz
University of Maryland, College Park, MD, USA
, - Pierre-Yves Strub
École Polytechnique, Paris, France
, - Xiaodi Wu
University of Maryland, College Park, MD, USA
, - Li Zhou
MPI-SP, Bochum, Ghana
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security•November 2021, pp 2564-2586• https://doi.org/10.1145/3460120.3484567EasyCrypt is a formal verification tool used extensively for formalizing concrete security proofs of cryptographic constructions. However, the EasyCrypt formal logics consider only classical at- tackers, which means that post-quantum security proofs ...
- 11Citation
- 1,334
- Downloads
MetricsTotal Citations11Total Downloads1,334Last 12 Months502Last 6 weeks75
- Manuel Barbosa
- research-articlePublic AccessPublished By ACMPublished By ACM
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
- Manuel Barbosa
University of Porto (FCUP) & INESC TEC, Porto, Portugal
, - Gilles Barthe
MPI-SP & IMDEA Software Institute, Bochum, Germany
, - Benjamin Grégoire
Inria - Université Côte d'Azur, Sophia Antipolis, France
, - Adrien Koutsos
Inria, Paris, France
, - Pierre-Yves Strub
Institut Polytechnique de Paris, Palaiseau, France
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security•November 2021, pp 2541-2563• https://doi.org/10.1145/3460120.3484548In this paper we enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial ...
- 9Citation
- 561
- Downloads
MetricsTotal Citations9Total Downloads561Last 12 Months245Last 6 weeks48
- Manuel Barbosa
- research-articleOpen AccessPublished By ACMPublished By ACM
Formal verification of a constant-time preserving C compiler
- Gilles Barthe
MPI for Security and Privacy, Germany / IMDEA Software Institute, Spain
, - Sandrine Blazy
University of Rennes, France / Inria, France / CNRS, France / IRISA, France
, - Benjamin Grégoire
Inria, France
, - Rémi Hutin
University of Rennes, France / Inria, France / CNRS, France / IRISA, France
, - Vincent Laporte
Inria, France
, - David Pichardie
University of Rennes, France / Inria, France / CNRS, France / IRISA, France
, - Alix Trieu
Aarhus University, Denmark
Proceedings of the ACM on Programming Languages, Volume 4, Issue POPL•January 2020, Article No.: 7, pp 1-30 • https://doi.org/10.1145/3371075Timing side-channels are arguably one of the main sources of vulnerabilities in cryptographic implementations. One effective mitigation against timing side-channels is to write programs that do not perform secret-dependent branches and memory accesses. ...
- 43Citation
- 1,975
- Downloads
MetricsTotal Citations43Total Downloads1,975Last 12 Months306Last 6 weeks35- 1
Supplementary Materiala7-barthe.webm
- Gilles Barthe
- research-articleOpen AccessPublished By ACMPublished By ACM
Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3
- José Bacelar Almeida
Universidade do Minho & INESC-TEC, Braga, Portugal
, - Cécile Baritel-Ruet
Université Côte d'Azur & Inria Sophia-Antipolis, Sophia-Antipolis, France
, - Manuel Barbosa
Universidade do Porto & INESC-TEC, Porto, Portugal
, - Gilles Barthe
MPI-SP & IMDEA Software Institute, Bochum, Germany
, - François Dupressoir
University of Surrey & University of Bristol, Bristol, United Kingdom
, - Benjamin Grégoire
Inria Sophia-Antipolis, Sophia-Antipolis, France
, - Vincent Laporte
Inria, Rennes, France
, - Tiago Oliveira
Universidade do Porto & INESC-TEC & FCUP, Porto, Portugal
, - Alley Stoughton
Boston University, Boston, MA, USA
, - Pierre-Yves Strub
École Polytechnique, Paris, France
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security•November 2019, pp 1607-1622• https://doi.org/10.1145/3319535.3363211We present a high-assurance and high-speed implementation of the SHA-3 hash function. Our implementation is written in the Jasmin programming language, and is formally verified for functional correctness, provable security and timing attack resistance ...
- 22Citation
- 1,091
- Downloads
MetricsTotal Citations22Total Downloads1,091Last 12 Months214Last 6 weeks33- 1
Supplementary Materialp1607-gregoire.webm
- José Bacelar Almeida
- research-articleOpen AccessPublished By ACMPublished By ACM
A Machine-Checked Proof of Security for AWS Key Management Service
- José Bacelar Almeida
University of Minho and INESC TEC, Braga, Portugal
, - Manuel Barbosa
University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - Gilles Barthe
IMDEA Software Institute and MPI-SP, Madrid, Spain
, - Matthew Campagna
Amazon Web Services, Seattle, WA, USA
, - Ernie Cohen
Amazon Web Services, New York, NY, USA
, - Benjamin Gregoire
Inria, Sophia-Antipolis, France
, - Vitor Pereira
University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - Bernardo Portela
University of Porto (FCUP) and INESC TEC, Porto, Portugal
, - Pierre-Yves Strub
École Polytechnique, Palaiseau, France
, - Serdar Tasiran
Amazon Web Services, New York, NY, USA
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security•November 2019, pp 63-78• https://doi.org/10.1145/3319535.3354228We present a machine-checked proof of security for the domain management protocol of Amazon Web Services' KMS (Key Management Service) a critical security service used throughout AWS and by AWS customers. Domain management is at the core of AWS KMS; it ...
- 15Citation
- 2,333
- Downloads
MetricsTotal Citations15Total Downloads2,333Last 12 Months264Last 6 weeks43- 1
Supplementary Materialp63-portela.webm
- José Bacelar Almeida
- Article
maskVerif: Automated Verification of Higher-Order Masking in Presence of Physical Defaults
- Gilles Barthe
MPI-SP and IMDEA Software Institute, Madrid, Spain
, - Sonia Belaïd
CryptoExperts, Paris, France
, - Gaëtan Cassiers
Université Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium
, - Pierre-Alain Fouque
Université de Rennes, Rennes, France
, - Benjamin Grégoire
Inria Sophia-Antipolis Méditerranée, Valbonne, France
, - Francois-Xavier Standaert
Université Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium
Computer Security – ESORICS 2019•September 2019, pp 300-318• https://doi.org/10.1007/978-3-030-29959-0_15AbstractPower and electromagnetic based side-channel attacks are serious threats against the security of cryptographic embedded devices. In order to mitigate these attacks, implementations use countermeasures, among which masking is currently the most ...
- 19Citation
MetricsTotal Citations19
- Gilles Barthe
- research-articleOpen AccessPublished By ACMPublished By ACM
FaCT: a DSL for timing-sensitive computation
- Sunjay Cauligi
University of California at San Diego, USA
, - Gary Soeller
University of California at San Diego, USA
, - Brian Johannesmeyer
University of California at San Diego, USA
, - Fraser Brown
Stanford University, USA
, - Riad S. Wahby
Stanford University, USA
, - John Renner
University of California at San Diego, USA
, - Benjamin Grégoire
Inria, France
, - Gilles Barthe
MPI for Security and Privacy, Germany / IMDEA Software Institute, Spain
, - Ranjit Jhala
University of California at San Diego, USA
, - Deian Stefan
University of California at San Diego, USA
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation•June 2019, pp 174-189• https://doi.org/10.1145/3314221.3314605Real-world cryptographic code is often written in a subset of C intended to execute in constant-time, thereby avoiding timing side channel vulnerabilities. This C subset eschews structured programming as we know it: if-statements, looping constructs, ...
- 45Citation
- 1,712
- Downloads
MetricsTotal Citations45Total Downloads1,712Last 12 Months354Last 6 weeks40- 2
- Sunjay Cauligi
- research-articlePublic AccessPublished By ACMPublished By ACM
Symbolic Proofs for Lattice-Based Cryptography
- Gilles Barthe
IMDEA Software Institute, Madrid, Spain
, - Xiong Fan
Cornell University, Ithaca, NY, USA
, - Joshua Gancher
Cornell University, Ithaca, NY, USA
, - Benjamin Grégoire
INRIA, Sophia-Antipolis, France
, - Charlie Jacomme
LSV & CNRS & ENS Paris-Saclay & INRIA & Université Paris-Saclay, Paris, France
, - Elaine Shi
Cornell University, Ithaca, NY, USA
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security•October 2018, pp 538-555• https://doi.org/10.1145/3243734.3243825Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions in the computational model. However, existing ...
- 9Citation
- 809
- Downloads
MetricsTotal Citations9Total Downloads809Last 12 Months138Last 6 weeks17- 1
Supplementary Materialp538-gancher.mp4
- Gilles Barthe
- research-articleOpen AccessPublished By ACMPublished By ACM
Proving expected sensitivity of probabilistic programs
- Gilles Barthe
IMDEA Software Institute, Spain
, - Thomas Espitau
UPMC, France
, - Benjamin Grégoire
Inria, France
, - Justin Hsu
University College London, UK
, - Pierre-Yves Strub
École Polytechnique, France
Proceedings of the ACM on Programming Languages, Volume 2, Issue POPL•January 2018, Article No.: 57, pp 1-29 • https://doi.org/10.1145/3158145Program sensitivity, also known as Lipschitz continuity, describes how small changes in a program’s input lead to bounded changes in the output. We propose an average notion of program sensitivity for probabilistic programs—expected sensitivity—that ...
- 21Citation
- 693
- Downloads
MetricsTotal Citations21Total Downloads693Last 12 Months110Last 6 weeks11- 1
Supplementary Materialexpectedsensitivityofprobabilisticprograms.webm
- Gilles Barthe
- research-articlePublic AccessPublished By ACMPublished By ACM
Jasmin: High-Assurance and High-Speed Cryptography
- José Bacelar Almeida
INESC TEC and Universidade do Minho, Braga, Portugal
, - Manuel Barbosa
INESC TEC and FCUP Universidade do Porto, Porto, Portugal
, - Gilles Barthe
IMDEA Software Institute, Madrid, Spain
, - Arthur Blot
ENS Lyon, Lyon, France
, - Benjamin Grégoire
Inria Sophia-Antipolis, Valbonne, France
, - Vincent Laporte
IMDEA Software Institute, Madrid, Spain
, - Tiago Oliveira
INESC TEC and FCUP Universidade do Porto, Porto, Portugal
, - Hugo Pacheco
INESC TEC and Universidade do Minho, Braga, Portugal
, - Benedikt Schmidt
Google Inc., Mountain View, CA, USA
, - Pierre-Yves Strub
École Polytechnique, Paris, France
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security•October 2017, pp 1807-1823• https://doi.org/10.1145/3133956.3134078Jasmin is a framework for developing high-speed and high-assurance cryptographic software. The framework is structured around the Jasmin programming language and its compiler. The language is designed for enhancing portability of programs and for ...
- 72Citation
- 1,713
- Downloads
MetricsTotal Citations72Total Downloads1,713Last 12 Months522Last 6 weeks81- 1
Supplementary Materialvincentlaporte-jasmin.mp4
- José Bacelar Almeida
- research-articlePublic AccessPublished By ACMPublished By ACM
A Fast and Verified Software Stack for Secure Function Evaluation
- José Bacelar Almeida
INESC TEC & Universidade do Minho, Braga, Portugal
, - Manuel Barbosa
INESC TEC & FCUP Universidade do Porto, Porto, Portugal
, - Gilles Barthe
IMDEA Software Institute, Madrid, Spain
, - François Dupressoir
University of Surrey, Guildford, United Kingdom
, - Benjamin Grégoire
Inria Sophia-Antipolis, Nice, France
, - Vincent Laporte
IMDEA Software Institute, Madrid, Spain
, - Vitor Pereira
INESC TEC & FCUP Universidade do Porto, Porto, Portugal
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security•October 2017, pp 1989-2006• https://doi.org/10.1145/3133956.3134017We present a high-assurance software stack for secure function evaluation (SFE). Our stack consists of three components: i. a verified compiler (CircGen) that translates C programs into Boolean circuits; ii. a verified implementation of Yao's SFE ...
- 20Citation
- 545
- Downloads
MetricsTotal Citations20Total Downloads545Last 12 Months110Last 6 weeks13- 1
Supplementary Materialvitorpereira-softwarestack.mp4
- José Bacelar Almeida
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner