Остановите войну!
for scientists:
default search action
Huijia Lin
- > Home > Persons > Huijia Lin
Publications
- 2024
- [j6]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. Commun. ACM 67(3): 97-105 (2024) - 2023
- [c65]Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs:
The Pseudorandom Oracle Model and Ideal Obfuscation. CRYPTO (4) 2023: 233-262 - [c64]Quang Dao, Yuval Ishai, Aayush Jain, Huijia Lin:
Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. CRYPTO (2) 2023: 315-348 - [c62]Aayush Jain, Huijia Lin, Paul Lou, Amit Sahai:
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-quantum i풪. EUROCRYPT (1) 2023: 205-235 - [c61]Aayush Jain, Huijia Lin, Ji Luo:
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. EUROCRYPT (3) 2023: 479-510 - [i52]Quang Dao, Yuval Ishai, Aayush Jain, Huijia Lin:
Multi-Party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. IACR Cryptol. ePrint Arch. 2023: 1593 (2023) - 2022
- [c57]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC0. EUROCRYPT (1) 2022: 670-699 - [i46]Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs:
The Pseudorandom Oracle Model and Ideal Obfuscation. IACR Cryptol. ePrint Arch. 2022: 1204 (2022) - [i45]Aayush Jain, Huijia Lin, Ji Luo:
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2022: 1317 (2022) - [i44]Aayush Jain, Huijia Lin, Paul Lou, Amit Sahai:
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪. IACR Cryptol. ePrint Arch. 2022: 1637 (2022) - 2021
- [c54]Samuel B. Hopkins, Aayush Jain, Huijia Lin:
Counterexamples to New Circular Security Assumptions Underlying iO. CRYPTO (2) 2021: 673-700 - [c53]Romain Gay, Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification. EUROCRYPT (3) 2021: 97-126 - [c51]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) 2021: 724-753 - [c49]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability obfuscation from well-founded assumptions. STOC 2021: 60-73 - [i43]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-Interactive Secure Computation from LWE. IACR Cryptol. ePrint Arch. 2021: 378 (2021) - [i42]Samuel B. Hopkins, Aayush Jain, Huijia Lin:
Counterexamples to New Circular Security Assumptions Underlying iO. IACR Cryptol. ePrint Arch. 2021: 889 (2021) - [i40]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0. IACR Cryptol. ePrint Arch. 2021: 1334 (2021) - 2020
- [i39]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. CoRR abs/2008.09317 (2020) - [i37]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. Electron. Colloquium Comput. Complex. TR20 (2020) - [i34]Romain Gay, Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification. IACR Cryptol. ePrint Arch. 2020: 764 (2020) - [i33]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. IACR Cryptol. ePrint Arch. 2020: 1003 (2020) - 2019
- [c44]Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. CRYPTO (3) 2019: 284-332 - [c43]Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O. EUROCRYPT (1) 2019: 251-281 - [i29]Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. IACR Cryptol. ePrint Arch. 2019: 643 (2019) - [i28]Aayush Jain, Huijia Lin, Christian Matt, Amit Sahai:
How to leverage hardness of constant degree expanding polynomials over R to build iO. IACR Cryptol. ePrint Arch. 2019: 1030 (2019) - [i27]Aayush Jain, Huijia Lin, Amit Sahai:
Simplifying Constructions and Assumptions for i풪. IACR Cryptol. ePrint Arch. 2019: 1252 (2019)
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-04-25 01:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint