Adi Akavia

Orcid: 0000-0003-0853-3576

Affiliations:
  • MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA


According to our database1, Adi Akavia authored at least 35 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Privacy Preserving Feature Selection for Sparse Linear Regression.
Proc. Priv. Enhancing Technol., January, 2024

2023
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE.
IACR Cryptol. ePrint Arch., 2023

CSHER: A System for Compact Storage with HE-Retrieval.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Privacy-Preserving Decision Trees Training and Prediction.
ACM Trans. Priv. Secur., 2022

Cross Chain Atomic Swaps in the Absence of Time via Attribute Verifiable Timed Commitments.
IACR Cryptol. ePrint Arch., 2022

Compact Storage for Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2022

Achievable CCA2 Relaxation for Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2022

Private Epigenetic PaceMaker Detector Using Homomorphic Encryption - Extended Abstract.
Proceedings of the Bioinformatics Research and Applications - 18th International Symposium, 2022

2021
On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2021

2020
Topology-Hiding Computation on All Graphs.
J. Cryptol., 2020

Optimal cache placement with local sharing: An ISP guide to the benefits of the sharing economy.
Comput. Networks, 2020

2019
Secure Data Retrieval on the Cloud: Homomorphic Encryption meets Coresets.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free.
Proc. Priv. Enhancing Technol., 2019

Linear-Regression on Packed Encrypted Data in the Two-Server Model.
IACR Cryptol. ePrint Arch., 2019

Privacy-Preserving Decision Tree Training and Prediction against Malicious Server.
IACR Cryptol. ePrint Arch., 2019

2018
Secure Search via Multi-Ring Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2018

Secure Search on Encrypted Data via Multi-Ring Sketch.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Topology-Hiding Computation Beyond Logarithmic Diameter.
IACR Cryptol. ePrint Arch., 2017

Secure Search on the Cloud via Coresets and Sketches.
CoRR, 2017

2016
Learning Significant Fourier Coefficients over Finite Abelian Groups.
Encyclopedia of Algorithms, 2016

2015
To share content or not to share? This is the peering question.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

2014
Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions.
IEEE Trans. Inf. Theory, 2014

Explicit small sets with ε-discrepancy on Bohr sets.
Inf. Process. Lett., 2014

Candidate weak pseudorandom functions in AC<sup>0</sup> ○ MOD<sub>2</sub>.
Electron. Colloquium Comput. Complex., 2014

2012
Distributed public key schemes secure against continual leakage.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2010
Erratum for: on basing one-way functions on NP-hardness.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions.
Proceedings of the COLT 2010, 2010

2009
Simultaneous Hardcore Bits and Cryptography against Memory Attacks.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Solving Hidden Number Problem with One Bit Oracle and Advice.
Proceedings of the Advances in Cryptology, 2009

2008
Learning Significant Fourier Coefficients over Finite Abelian Groups.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Learning noisy characters, MPC, and cryptographic hardcore predicates.
PhD thesis, 2008

Finding Significant Fourier Transform Coefficients Deterministically and Locally.
Electron. Colloquium Comput. Complex., 2008

Perturbation codes.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2006
On basing one-way functions on NP-hardness.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2003
Proving Hard-Core Predicates Using List Decoding.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003


  Loading...