default search action
Ethan Mook
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [i7]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. IACR Cryptol. ePrint Arch. 2025: 235 (2025) - [i6]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Black Box Crypto is Useless for Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2025: 552 (2025) - 2024
- [c5]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. CRYPTO (3) 2024: 107-142 - [c4]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. CRYPTO (8) 2024: 240-273 - [c3]Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs:
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation. EUROCRYPT (2) 2024: 190-218 - [i5]Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs:
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation. IACR Cryptol. ePrint Arch. 2024: 68 (2024) - [i4]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. IACR Cryptol. ePrint Arch. 2024: 897 (2024) - 2023
- [c2]Wei-Kai Lin
, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. STOC 2023: 595-608 - 2022
- [j1]Ethan Mook, Chris Peikert
Lattice (List) Decoding Near Minkowski's Inequality. IEEE Trans. Inf. Theory 68(2): 863-870 (2022) - [c1]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-quantum Insecurity from LWE. TCC (1) 2022: 3-32 - [i3]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-Quantum Insecurity from LWE. IACR Cryptol. ePrint Arch. 2022: 869 (2022) - [i2]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. IACR Cryptol. ePrint Arch. 2022: 1703 (2022) - 2020
- [i1]Ethan Mook, Chris Peikert:
Lattice (List) Decoding Near Minkowski's Inequality. CoRR abs/2010.04809 (2020)
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-04-28 21:01 CEST 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: