default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilly Quach
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Chris Brzuska, Geoffroy Couteau, Christoph Egger, Willy Quach:
On Bounded Storage Key Agreement and One-Way Functions. TCC (1) 2024: 287-318- 2023
- [c17]Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach:
A Note on Non-interactive Zero-Knowledge from CDH. CRYPTO (4) 2023: 731-764 - [c16]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. EUROCRYPT (1) 2023: 86-116 - [c15]Willy Quach, LaKyah Tyner, Daniel Wichs:
Lower Bounds on Anonymous Whistleblowing. TCC (3) 2023: 3-32 - [i17]Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach:
A Note on Non-Interactive Zero-Knowledge from CDH. IACR Cryptol. ePrint Arch. 2023: 970 (2023) - [i16]Willy Quach, LaKyah Tyner, Daniel Wichs:
Lower Bounds on Anonymous Whistleblowing. IACR Cryptol. ePrint Arch. 2023: 1483 (2023) - 2022
- [c14]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Authentication in the Bounded Storage Model. EUROCRYPT (3) 2022: 737-766 - [c13]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-quantum Insecurity from LWE. TCC (1) 2022: 3-32 - [i15]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Authentication in the Bounded Storage Model. IACR Cryptol. ePrint Arch. 2022: 690 (2022) - [i14]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-Quantum Insecurity from LWE. IACR Cryptol. ePrint Arch. 2022: 869 (2022) - 2021
- [c12]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? CRYPTO (4) 2021: 334-363 - [c11]Willy Quach, Brent Waters, Daniel Wichs:
Targeted Lossy Functions and Applications. CRYPTO (4) 2021: 424-453 - [c10]Lalita Devadas
, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. TCC (2) 2021: 256-287 - [i13]Willy Quach, Brent Waters, Daniel Wichs:
Targeted Lossy Functions and Applications. IACR Cryptol. ePrint Arch. 2021: 895 (2021) - [i12]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. IACR Cryptol. ePrint Arch. 2021: 1226 (2021) - [i11]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. IACR Cryptol. ePrint Arch. 2021: 1270 (2021) - 2020
- [c9]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. CRYPTO (1) 2020: 401-429 - [c8]Olivier Beaumont, Julien Langou, Willy Quach, Alena Shilova:
A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule. Euro-Par 2020: 134-150 - [c7]Willy Quach:
UC-Secure OT from LWE, Revisited. SCN 2020: 192-211 - [i10]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. IACR Cryptol. ePrint Arch. 2020: 771 (2020) - [i9]Willy Quach:
UC-Secure OT from LWE, Revisited. IACR Cryptol. ePrint Arch. 2020: 819 (2020) - [i8]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? IACR Cryptol. ePrint Arch. 2020: 915 (2020)
2010 – 2019
- 2019
- [c6]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. CRYPTO (3) 2019: 670-700 - [c5]Rishab Goyal, Willy Quach, Brent Waters, Daniel Wichs:
Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions. CRYPTO (3) 2019: 826-855 - [c4]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. EUROCRYPT (2) 2019: 593-621 - [i7]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. IACR Cryptol. ePrint Arch. 2019: 235 (2019) - [i6]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. IACR Cryptol. ePrint Arch. 2019: 242 (2019) - [i5]Rishab Goyal, Willy Quach, Brent Waters, Daniel Wichs:
Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions. IACR Cryptol. ePrint Arch. 2019: 636 (2019) - 2018
- [c3]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. FOCS 2018: 859-870 - [c2]Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach:
Hash Proof Systems over Lattices Revisited. Public Key Cryptography (2) 2018: 644-674 - [c1]Willy Quach, Daniel Wichs, Giorgos Zirdelis:
Watermarking PRFs Under Standard Assumptions: Public Marking and Security with Extraction Queries. TCC (2) 2018: 669-698 - [i4]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. IACR Cryptol. ePrint Arch. 2018: 409 (2018) - [i3]Willy Quach, Daniel Wichs, Giorgos Zirdelis:
Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries. IACR Cryptol. ePrint Arch. 2018: 906 (2018) - 2017
- [i2]Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach:
Hash Proof Systems over Lattices Revisited. IACR Cryptol. ePrint Arch. 2017: 997 (2017) - 2015
- [i1]Willy Quach, Julien Langou:
A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling. CoRR abs/1510.05107 (2015)
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 2024-12-13 19:13 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:
