Adrià Gascón

Orcid: 0000-0002-1807-8311

According to our database1, Adrià Gascón authored at least 64 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model.
IACR Cryptol. ePrint Arch., 2024

Malicious Security for Sparse Private Histograms.
IACR Cryptol. ePrint Arch., 2024

Willow: Secure Aggregation with One-Shot Clients.
IACR Cryptol. ePrint Arch., 2024

Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning.
IACR Cryptol. ePrint Arch., 2024

Private federated discovery of out-of-vocabulary words for Gboard.
CoRR, 2024

Confidential Federated Computations.
CoRR, 2024

2023
UN Handbook on Privacy-Preserving Computation Techniques.
CoRR, 2023

Federated Heavy Hitter Recovery under Linear Sketching.
Proceedings of the International Conference on Machine Learning, 2023

Amplification by Shuffling without Shuffling.
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.
Proc. Priv. Enhancing Technol., 2022

ACORN: Input Validation for Secure Aggregation.
IACR Cryptol. ePrint Arch., 2022

MPC-Friendly Commitments for Publicly Verifiable Covert Security.
IACR Cryptol. ePrint Arch., 2022

Distributed, Private, Sparse Histograms in the Two-Server Model.
IACR Cryptol. ePrint Arch., 2022

2021
Reconstructing Genotypes in Private Genomic Databases from Genetic Risk Scores.
J. Comput. Biol., May, 2021

Formalising $\varSigma$-Protocols and Commitment Schemes Using CryptHOL.
J. Autom. Reason., 2021

Advances and Open Problems in Federated Learning.
Found. Trends Mach. Learn., 2021

2020
PrivEdge: From Local to Distributed Private Training and Prediction.
IEEE Trans. Inf. Forensics Secur., 2020

Secure and Scalable Document Similarity on Distributed Databases: Differential Privacy to the Rescue.
Proc. Priv. Enhancing Technol., 2020

Grammar-Based Compression of Unranked Trees.
Theory Comput. Syst., 2020

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead.
IACR Cryptol. ePrint Arch., 2020

Private Summation in the Multi-Message Shuffle Model.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Data Generation for Neural Programming by Example.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Private Protocols for U-Statistics in the Local Model and Beyond.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Distributed Vector-OLE: Improved Constructions and Implementation.
IACR Cryptol. ePrint Arch., 2019

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning.
IACR Cryptol. ePrint Arch., 2019

Formalising Σ-Protocols and Commitment Schemes using CryptHOL.
IACR Cryptol. ePrint Arch., 2019

Formalising Oblivious Transfer in the Semi-Honest and Malicious Model in CryptHOL.
IACR Cryptol. ePrint Arch., 2019

Advances and Open Problems in Federated Learning.
CoRR, 2019

Improved Summation from Shuffling.
CoRR, 2019

Differentially Private Summation with Multi-Message Shuffling.
CoRR, 2019

On the Formalisation of Σ-Protocols and Commitment Schemes.
Proceedings of the Principles of Security and Trust - 8th International Conference, 2019

The Privacy Blanket of the Shuffle Model.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

PPML '19: Privacy Preserving Machine Learning.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

QUOTIENT: Two-Party Secure Neural Network Training and Prediction.
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?
IEEE Internet Comput., 2018

Private Nearest Neighbors Classification in Federated Databases.
IACR Cryptol. ePrint Arch., 2018

TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service.
Proceedings of the 35th International Conference on Machine Learning, 2018

Blind Justice: Fairness with Encrypted Sensitive Attributes.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Privacy-Preserving Distributed Linear Regression on High-Dimensional Data.
Proc. Priv. Enhancing Technol., 2017

How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
The HOM Problem is EXPTIME-Complete.
SIAM J. Comput., 2016

Secure Linear Regression on Vertically Partitioned Datasets.
IACR Cryptol. ePrint Arch., 2016

Composition and Substitution in Provenance and Workflows.
Proceedings of the 8th USENIX Workshop on the Theory and Practice of Provenance, 2016

Provenance Segmentation.
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.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015
One Context Unification Problems Solvable in Polynomial Time.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Two-Restricted One Context Unification is in Polynomial Time.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Program Synthesis Using Dual Interpretation.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
Variants of unification considering compression and context variables.
PhD thesis, 2014

Reverse Engineering Digital Circuits Using Structural and Functional Analyses.
IEEE Trans. Emerg. Top. Comput., 2014

Synthesis of a simple self-stabilizing system.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

A Synthesized Algorithm for Interactive Consistency.
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

Template-based circuit understanding.
Proceedings of the Formal Methods in Computer-Aided Design, 2014

2013
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints.
J. Autom. Reason., 2013

WordRev: Finding word-level structures in a sea of bit-level gates.
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.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011
Unification and matching on compressed terms.
ACM Trans. Comput. Log., 2011

First-Order Unification on Compressed Terms.
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.
Proceedings of the CSEDU 2011, 2011

2010
Context unification with one context variable.
J. Symb. Comput., 2010

2009
Unification with Singleton Tree Grammars.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008
Closure of Tree Automata Languages under Innermost Rewriting.
Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Context Matching for Compressed Terms.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008


  Loading...