Huijia Lin

According to our database1, Huijia Lin authored at least 87 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking.
IACR Cryptol. ePrint Arch., 2023

Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices: Garbled Circuits of Optimal Size, Laconic Functional Evaluation, and More.
IACR Cryptol. ePrint Arch., 2023

Multi-Party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN.
IACR Cryptol. ePrint Arch., 2023

New Ways to Garble Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2023

New Insights into Multi-Calibration.
CoRR, 2023

Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

From Pseudorandomness to Multi-Group Fairness and Back.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore.
IACR Cryptol. ePrint Arch., 2022

Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols.
IACR Cryptol. ePrint Arch., 2022

ABE for Circuits with Constant-Size Secret Keys and Adaptive Security.
IACR Cryptol. ePrint Arch., 2022

Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪.
IACR Cryptol. ePrint Arch., 2022

On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2022

The Pseudorandom Oracle Model and Ideal Obfuscation.
IACR Cryptol. ePrint Arch., 2022

Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC<sup>0</sup>.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0.
IACR Cryptol. ePrint Arch., 2021

Counterexamples to New Circular Security Assumptions Underlying iO.
IACR Cryptol. ePrint Arch., 2021

Non-malleable Commitments against Quantum Attacks.
IACR Cryptol. ePrint Arch., 2021

Multiparty Reusable Non-Interactive Secure Computation from LWE.
IACR Cryptol. ePrint Arch., 2021

Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk).
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.
SIAM J. Comput., 2020

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More.
IACR Cryptol. ePrint Arch., 2020

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin.
IACR Cryptol. ePrint Arch., 2020

Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL.
IACR Cryptol. ePrint Arch., 2020

Oblivious Transfer is in MiniQCrypt.
IACR Cryptol. ePrint Arch., 2020

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification.
IACR Cryptol. ePrint Arch., 2020

Multiparty Reusable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Indistinguishability Obfuscation from Well-Founded Assumptions.
Electron. Colloquium Comput. Complex., 2020

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Compact Adaptively Secure ABE from k-Lin: Beyond NC<sup>1</sup> and Towards NL.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Succinct and Adaptively Secure ABE for ABP from k-Lin.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Simplifying Constructions and Assumptions for i풪.
IACR Cryptol. ePrint Arch., 2019

How to leverage hardness of constant degree expanding polynomials over R to build iO.
IACR Cryptol. ePrint Arch., 2019

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
IACR Cryptol. ePrint Arch., 2019

How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018

Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2018

One-Message Zero Knowledge and Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes Against Bounded Polynomial Time Tampering.
IACR Cryptol. ePrint Arch., 2018

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Pharos: Privacy Hazards of Replicating ORAM Stores.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

2017
The Hunting of the SNARK.
J. Cryptol., 2017

Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs.
IACR Cryptol. ePrint Arch., 2017

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2017

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.
IACR Cryptol. ePrint Arch., 2017

Foundations of Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2017

k-Round MPC from k-Round OT via Garbled Interactive Circuits.
IACR Cryptol. ePrint Arch., 2017

Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions.
SIAM J. Comput., 2016

Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings.
IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation with Non-trivial Efficiency.
IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs.
IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes.
IACR Cryptol. ePrint Arch., 2016

On Removing Graded Encodings from Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

TaoStore: Overcoming Asynchronicity in Oblivious Data Storage.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015
Constant-Round Nonmalleable Commitments from Any One-Way Function.
J. ACM, 2015

Output-Compressing Randomized Encodings and Applications.
IACR Cryptol. ePrint Arch., 2015

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.
IACR Cryptol. ePrint Arch., 2015

Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 2015

Delegating RAM Computations with Adaptive Soundness and Privacy.
IACR Cryptol. ePrint Arch., 2015

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

2014
Succinct Garbling Schemes and Applications.
IACR Cryptol. ePrint Arch., 2014

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Obfuscation of Probabilistic Circuits and Applications.
IACR Cryptol. ePrint Arch., 2014

The Computational Benefit of Correlated Instances.
Electron. Colloquium Comput. Complex., 2014

Leakage-Tolerant Computation with Input-Independent Preprocessing.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the power of nonuniformity in proofs of security.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Constant-Round Concurrent Zero Knowledge from P-Certificates.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

From Unprovability to Environmentally Friendly Protocols.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Amplification of Chosen-Ciphertext Security.
Proceedings of the Advances in Cryptology, 2013

2012
Concurrent Security.
PhD thesis, 2012

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2012

Black-Box Constructions of Composable Protocols without Set-Up.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

A Unified Framework for UC from Only OT.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
After-the-Fact Leakage in Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2011

Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs.
IACR Cryptol. ePrint Arch., 2011

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
Constant-round Non-Malleable Commitments from Any One-Way Function.
IACR Cryptol. ePrint Arch., 2010

Concurrent Non-Malleable Zero Knowledge Proofs.
Proceedings of the Advances in Cryptology, 2010

2009
A unified framework for concurrent security: universal composability from stand-alone non-malleability.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Non-malleability amplification.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Concurrent Non-malleable Commitments from Any One-Way Function.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Composable Information Gradients in Wireless Sensor Networks.
Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

2007
RICH: Automatically Protecting Against Integer-Based Vulnerabilities.
Proceedings of the Network and Distributed System Security Symposium, 2007


  Loading...