default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdi Akavia
Person information
- affiliation: MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]Adi Akavia
, Craig Gentry, Shai Halevi, Margarita Vald:
Achievable CCA2 Relaxation for Homomorphic Encryption. J. Cryptol. 38(1): 5 (2025)- 2024
- [j8]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. Proc. Priv. Enhancing Technol. 2024(1): 300-313 (2024) - [c21]Meir Goldenberg, Loay Mualem, Amit Shahar, Sagi Snir, Adi Akavia:
Privacy Preserving Epigenetic PaceMaker: Stronger Privacy and Improved Efficiency. RECOMB 2024: 412-416 - 2023
- [c20]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. CSF 2023: 489-504 - [c19]Adi Akavia, Neta Oren, Boaz Sapir, Margarita Vald:
CSHER: A System for Compact Storage with HE-Retrieval. USENIX Security Symposium 2023: 4751-4768 - [i17]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. IACR Cryptol. ePrint Arch. 2023: 9 (2023) - [i16]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. IACR Cryptol. ePrint Arch. 2023: 1354 (2023) - 2022
- [j7]Adi Akavia, Max Leibovich, Yehezkel S. Resheff, Roey Ron, Moni Shahar, Margarita Vald:
Privacy-Preserving Decision Trees Training and Prediction. ACM Trans. Priv. Secur. 25(3): 24:1-24:30 (2022) - [c18]Yacov Manevich, Adi Akavia:
Cross Chain Atomic Swaps in the Absence of Time via Attribute Verifiable Timed Commitments. EuroS&P 2022: 606-625 - [c17]Meir Goldenberg, Sagi Snir, Adi Akavia:
Private Epigenetic PaceMaker Detector Using Homomorphic Encryption - Extended Abstract. ISBRA 2022: 52-61 - [c16]Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald:
Achievable CCA2 Relaxation for Homomorphic Encryption. TCC (2) 2022: 70-99 - [i15]Adi Akavia, Neta Oren, Boaz Sapir, Margarita Vald:
Compact Storage for Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 273 (2022) - [i14]Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald:
Achievable CCA2 Relaxation for Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 282 (2022) - [i13]Yacov Manevich, Adi Akavia:
Cross Chain Atomic Swaps in the Absence of Time via Attribute Verifiable Timed Commitments. IACR Cryptol. ePrint Arch. 2022: 717 (2022) - 2021
- [i12]Adi Akavia, Max Leibovich, Yehezkel S. Resheff, Roey Ron, Moni Shahar, Margarita Vald:
Privacy-Preserving Decision Trees Training and Prediction. IACR Cryptol. ePrint Arch. 2021: 768 (2021) - [i11]Adi Akavia, Margarita Vald:
On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2021: 803 (2021) - 2020
- [j6]Osnat Mokryn, Adi Akavia, Yossi Kanizo:
Optimal cache placement with local sharing: An ISP guide to the benefits of the sharing economy. Comput. Networks 171: 107153 (2020) - [j5]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on All Graphs. J. Cryptol. 33(1): 176-227 (2020) - [c15]Adi Akavia, Max Leibovich, Yehezkel S. Resheff, Roey Ron, Moni Shahar, Margarita Vald:
Privacy-Preserving Decision Trees Training and Prediction. ECML/PKDD (1) 2020: 145-161
2010 – 2019
- 2019
- [j4]Adi Akavia, Craig Gentry, Shai Halevi, Max Leibovich:
Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. Proc. Priv. Enhancing Technol. 2019(3): 87-107 (2019) - [j3]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Data Retrieval on the Cloud: Homomorphic Encryption meets Coresets. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(2): 80-106 (2019) - [c14]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. WAHC@CCS 2019: 21-32 - [i10]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. IACR Cryptol. ePrint Arch. 2019: 1238 (2019) - [i9]Adi Akavia, Max Leibovich, Yehezkel S. Resheff, Roey Ron, Moni Shahar, Margarita Vald:
Privacy-Preserving Decision Tree Training and Prediction against Malicious Server. IACR Cryptol. ePrint Arch. 2019: 1282 (2019) - 2018
- [c13]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search on Encrypted Data via Multi-Ring Sketch. CCS 2018: 985-1001 - [i8]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search via Multi-Ring Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 245 (2018) - [i7]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Data Retrieval On The Cloud Homomorphic Encryption Meets Coresets. IACR Cryptol. ePrint Arch. 2018: 1003 (2018) - [i6]Adi Akavia, Craig Gentry, Shai Halevi, Max Leibovich:
Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. IACR Cryptol. ePrint Arch. 2018: 1235 (2018) - 2017
- [c12]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on All Graphs. CRYPTO (1) 2017: 447-467 - [c11]Adi Akavia, Tal Moran:
Topology-Hiding Computation Beyond Logarithmic Diameter. EUROCRYPT (3) 2017: 609-637 - [i5]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search on the Cloud via Coresets and Sketches. CoRR abs/1708.05811 (2017) - [i4]Adi Akavia, Tal Moran:
Topology-Hiding Computation Beyond Logarithmic Diameter. IACR Cryptol. ePrint Arch. 2017: 130 (2017) - [i3]Adi Akavia, Rio LaVigne, Tal Moran:
Topology-Hiding Computation on all Graphs. IACR Cryptol. ePrint Arch. 2017: 296 (2017) - 2016
- [r2]Adi Akavia:
Learning Significant Fourier Coefficients over Finite Abelian Groups. Encyclopedia of Algorithms 2016: 1081-1086 - 2015
- [c10]Osnat Mokryn, Adi Akavia, Dan Ben-Yaacov:
To share content or not to share? This is the peering question. ISCC 2015: 869-876 - 2014
- [j2]Adi Akavia:
Explicit small sets with ε-discrepancy on Bohr sets. Inf. Process. Lett. 114(10): 564-567 (2014) - [j1]Adi Akavia:
Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions. IEEE Trans. Inf. Theory 60(3): 1733-1741 (2014) - [c9]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. ITCS 2014: 251-260 - [i2]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [c8]Adi Akavia, Shafi Goldwasser, Carmit Hazay:
Distributed public key schemes secure against continual leakage. PODC 2012: 155-164 - 2010
- [c7]Adi Akavia:
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions. COLT 2010: 381-393 - [c6]Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz:
Erratum for: on basing one-way functions on NP-hardness. STOC 2010: 795-796
2000 – 2009
- 2009
- [c5]Adi Akavia:
Solving Hidden Number Problem with One Bit Oracle and Advice. CRYPTO 2009: 337-354 - [c4]Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan:
Simultaneous Hardcore Bits and Cryptography against Memory Attacks. TCC 2009: 474-495 - 2008
- [b1]Adi Akavia:
Learning noisy characters, MPC, and cryptographic hardcore predicates. Massachusetts Institute of Technology, Cambridge, MA, USA, 2008 - [c3]Adi Akavia, Ramarathnam Venkatesan:
Perturbation codes. Allerton 2008: 1403-1409 - [r1]Adi Akavia:
Learning Significant Fourier Coefficients over Finite Abelian Groups. Encyclopedia of Algorithms 2008 - [i1]Adi Akavia:
Finding Significant Fourier Transform Coefficients Deterministically and Locally. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [c2]Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz:
On basing one-way functions on NP-hardness. STOC 2006: 701-710 - 2003
- [c1]Adi Akavia, Shafi Goldwasser, Shmuel Safra:
Proving Hard-Core Predicates Using List Decoding. FOCS 2003: 146-157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
