Adrià Gascón

Peter Kairouz

Ziteng Sun

Ananda Theertha Suresh

Proceedings of the International Conference on Machine Learning, 2023

Amplification by Shuffling without Shuffling.

[BibT_eX]

[DOI]

Borja Balle

James Bell

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Towards Sparse Federated Analytics: Location Heatmaps under Distributed Differential Privacy with Secure Aggregation.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2022

ACORN: Input Validation for Secure Aggregation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

MPC-Friendly Commitments for Publicly Verifiable Covert Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Distributed, Private, Sparse Histograms in the Two-Server Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Formalising $\varSigma$-Protocols and Commitment Schemes Using CryptHOL.

[BibT_eX]

[DOI]

J. Autom. Reason., 2021

Advances and Open Problems in Federated Learning.

[BibT_eX]

[DOI]

Rafael G. L. D'Oliveira

Ananda Theertha Suresh

Found. Trends Mach. Learn., 2021

2020

PrivEdge: From Local to Distributed Private Training and Prediction.

[BibT_eX]

[DOI]

Ali Shahin Shamsabadi

Hamed Haddadi

Andrea Cavallaro

IEEE Trans. Inf. Forensics Secur., 2020

Secure and Scalable Document Similarity on Distributed Databases: Differential Privacy to the Rescue.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2020

Grammar-Based Compression of Unranked Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Reconstructing Genotypes in Private Genomic Databases from Genetic Risk Scores.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2020

Private Summation in the Multi-Message Shuffle Model.

[BibT_eX]

[DOI]

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Data Generation for Neural Programming by Example.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Private Protocols for U-Statistics in the Local Model and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Distributed Vector-OLE: Improved Constructions and Implementation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Formalising Σ-Protocols and Commitment Schemes using CryptHOL.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Formalising Oblivious Transfer in the Semi-Honest and Malicious Model in CryptHOL.

[BibT_eX]

[DOI]

David Butler

David Aspinall

IACR Cryptol. ePrint Arch., 2019

Advances and Open Problems in Federated Learning.

[BibT_eX]

[DOI]

Rafael G. L. D'Oliveira

Ananda Theertha Suresh

CoRR, 2019

Improved Summation from Shuffling.

[BibT_eX]

[DOI]

CoRR, 2019

Differentially Private Summation with Multi-Message Shuffling.

[BibT_eX]

[DOI]

CoRR, 2019

On the Formalisation of Σ-Protocols and Commitment Schemes.

[BibT_eX]

[DOI]

David Butler

David Aspinall

Proceedings of the Principles of Security and Trust - 8th International Conference, 2019

The Privacy Blanket of the Shuffle Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

PPML '19: Privacy Preserving Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

QUOTIENT: Two-Party Secure Neural Network Training and Prediction.

[BibT_eX]

[DOI]

Nitin Agrawal

Ali Shahin Shamsabadi

Matt J. Kusner

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Analytics without Tears or Is There a Way for Data to Be Anonymized and Yet Still Useful?

[BibT_eX]

[DOI]

Jon Crowcroft

IEEE Internet Comput., 2018

Private Nearest Neighbors Classification in Federated Databases.

[BibT_eX]

[DOI]

Phillipp Schoppmann

Borja Balle

IACR Cryptol. ePrint Arch., 2018

TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Blind Justice: Fairness with Encrypted Sensitive Attributes.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Privacy-Preserving Distributed Linear Regression on High-Dimensional Data.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2017

How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation.

[BibT_eX]

[DOI]

David Butler

David Aspinall

Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016

The HOM Problem is EXPTIME-Complete.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Secure Linear Regression on Vertically Partitioned Datasets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Composition and Substitution in Provenance and Workflows.

[BibT_eX]

[DOI]

Peter Buneman

Dave Murray-Rust

Proceedings of the 8th USENIX Workshop on the Theory and Practice of Provenance, 2016

Provenance Segmentation.

[BibT_eX]

[DOI]

Proceedings of the 8th USENIX Workshop on the Theory and Practice of Provenance, 2016

Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015

One Context Unification Problems Solvable in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Two-Restricted One Context Unification is in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Program Synthesis Using Dual Interpretation.

[BibT_eX]

[DOI]

Bruno Dutertre

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Variants of unification considering compression and context variables.

[BibT_eX]

[DOI]

PhD thesis, 2014

Reverse Engineering Digital Circuits Using Structural and Functional Analyses.

[BibT_eX]

[DOI]

IEEE Trans. Emerg. Top. Comput., 2014

Synthesis of a simple self-stabilizing system.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

A Synthesized Algorithm for Interactive Consistency.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

Template-based circuit understanding.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2014

2013

Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints.

[BibT_eX]

[DOI]

Carles Creus

J. Autom. Reason., 2013

WordRev: Finding word-level structures in a sea of bit-level gates.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Hardware-Oriented Security and Trust, 2013

2012

One-context Unification with STG-Compressed Terms is in NP.

[BibT_eX]

[DOI]

Carles Creus

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011

Unification and matching on compressed terms.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

First-Order Unification on Compressed Terms.

[BibT_eX]

[DOI]

Sebastian Maneth

Lander Ramos

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions.

[BibT_eX]

Proceedings of the CSEDU 2011, 2011

2010

Context unification with one context variable.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

2009

Unification with Singleton Tree Grammars.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Closure of Tree Automata Languages under Innermost Rewriting.

[BibT_eX]

[DOI]

Florent Jacquemard

Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Context Matching for Compressed Terms.

[BibT_eX]

[DOI]