# Adi Akavia

According to our database

Collaborative distances:

^{1}, Adi Akavia authored at least 24 papers between 2003 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2020

Topology-Hiding Computation on All Graphs.

J. Cryptology, 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.

PoPETs, 2019

Linear-Regression on Packed Encrypted Data in the Two-Server Model.

IACR Cryptology ePrint Archive, 2019

Privacy-Preserving Decision Tree Training and Prediction against Malicious Server.

IACR Cryptology ePrint Archive, 2019

2018

Secure Search via Multi-Ring Fully Homomorphic Encryption.

IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 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. Information Theory, 2014

Explicit small sets with ε-discrepancy on Bohr sets.

Inf. Process. Lett., 2014

Electronic Colloquium on Computational Complexity (ECCC), 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.

Electronic Colloquium on Computational Complexity (ECCC), 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