Huijia Lin

发表

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin

Huijia Lin, Ji Luo, Huijia Lin, 2020, IACR Cryptol. ePrint Arch..

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs

Rafael Pass, Huijia Lin, R. Pass, 2011, TCC.

Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings

Vinod Vaikuntanathan, Huijia Lin, V. Vaikuntanathan, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Output-Compressing Randomized Encodings and Applications

Rafael Pass, Karn Seth, Sidharth Telang, 2016, TCC.

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

Huijia Lin, Huijia Lin, 2016, EUROCRYPT.

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

Fabrice Benhamouda, Huijia Lin, Huijia Lin, 2018, EUROCRYPT.

On Removing Graded Encodings from Functional Encryption

Nir Bitansky, Omer Paneth, Huijia Lin, 2017, EUROCRYPT.

Multiparty Reusable Non-Interactive Secure Computation

Fabrice Benhamouda, Huijia Lin, Huijia Lin, 2020, IACR Cryptol. ePrint Arch..

The Computational Benefit of Correlated Instances

Shafi Goldwasser, Irit Dinur, Huijia Lin, 2015, ITCS.

Pharos: Privacy Hazards of Replicating ORAM Stores

Amr El Abbadi, Cetin Sahin, Stefano Tessaro, 2018, EDBT.

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles

Rafael Pass, Pratik Soni, Huijia Lin, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More

Hoeteck Wee, Tianren Liu, Huijia Lin, 2020, IACR Cryptol. ePrint Arch..

Concurrent Non-Malleable Zero Knowledge Proofs

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2010, CRYPTO.

Constant-Round Concurrent Zero Knowledge from P-Certificates

Kai-Min Chung, Rafael Pass, Huijia Lin, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Indistinguishability Obfuscation with Non-trivial Efficiency

Rafael Pass, Karn Seth, Sidharth Telang, 2016, Public Key Cryptography.

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions

Stefano Tessaro, Huijia Lin, Binyi Chen, 2016, TCC.

Succinct Garbling Schemes and Applications

Rafael Pass, Huijia Lin, 2014, IACR Cryptol. ePrint Arch..

A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

Susumu Kiyoshima, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2017, TCC.

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

Kai-Min Chung, Rafael Pass, Huijia Lin, 2012, IACR Cryptol. ePrint Arch..

From Unprovability to Environmentally Friendly Protocols

Ran Canetti, Rafael Pass, Huijia Lin, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Black-Box Constructions of Composable Protocols without Set-Up

Rafael Pass, Huijia Lin, R. Pass, 2012, CRYPTO.

Concurrent Non-malleable Commitments from Any One-Way Function

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2008, TCC.

A Unified Framework for UC from Only OT

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2012, ASIACRYPT.

Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs

Shafi Goldwasser, Aviad Rubinstein, Huijia Lin, 2011, IACR Cryptol. ePrint Arch..

On the power of nonuniformity in proofs of security

Kai-Min Chung, Rafael Pass, Mohammad Mahmoody, 2013, ITCS '13.

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification

Amit Sahai, Romain Gay, Huijia Lin, 2020, IACR Cryptol. ePrint Arch..

Delegating RAM Computations with Adaptive Soundness and Privacy

Kai-Min Chung, Yu-Chi Chen, Huijia Lin, 2016, TCC.

Amplification of Chosen-Ciphertext Security

Stefano Tessaro, Huijia Lin, Stefano Tessaro, 2013, EUROCRYPT.

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2018, TCC.

Multiparty Reusable Non-Interactive Secure Computation

Fabrice Benhamouda, Huijia Lin, Huijia Lin, 2020, IACR Cryptology ePrint Archive.

k-Round MPC from k-Round OT via Garbled Interactive Circuits

Fabrice Benhamouda, Huijia Lin, Huijia Lin, 2017, IACR Cryptol. ePrint Arch..

Obfuscation of Probabilistic Circuits and Applications

Ran Canetti, Vinod Vaikuntanathan, Stefano Tessaro, 2015, TCC.

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles

Rafael Pass, Pratik Soni, Huijia Lin, 2017, IACR Cryptol. ePrint Arch..

The Hunting of the SNARK

Nir Bitansky, Ran Canetti, Shafi Goldwasser, 2016, Journal of Cryptology.

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles

Rafael Pass, Pratik Soni, Huijia Lin, 2020, SIAM J. Comput..

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs

Stefano Tessaro, Huijia Lin, Stefano Tessaro, 2017, CRYPTO.

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

Nir Bitansky, Ran Canetti, Vinod Vaikuntanathan, 2018, SIAM J. Comput..

One-Message Zero Knowledge and Non-Malleable Commitments

Nir Bitansky, Huijia Lin, Nir Bitansky, 2018, IACR Cryptol. ePrint Arch..

A unified framework for concurrent security: universal composability from stand-alone non-malleability

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2009, STOC '09.

RICH: Automatically Protecting Against Integer-Based Vulnerabilities

David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh, 2007, NDSS.

Simplifying Constructions and Assumptions for i풪

Amit Sahai, Aayush Jain, Huijia Lin, 2019, IACR Cryptol. ePrint Arch..

Constant-round non-malleable commitments from any one-way function

Rafael Pass, Huijia Lin, R. Pass, 2011, STOC '11.

Succinct and Adaptively Secure ABE for ABP from k-Lin

Huijia Lin, Ji Luo, Huijia Lin, 2020, ASIACRYPT.

How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O

Amit Sahai, Aayush Jain, Huijia Lin, 2019, EUROCRYPT.

Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL

Huijia Lin, Ji Luo, Huijia Lin, 2020, IACR Cryptol. ePrint Arch..

Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs

Huijia Lin, Huijia Lin, 2017, CRYPTO.

Non-malleability amplification

Rafael Pass, Huijia Lin, R. Pass, 2009, STOC '09.

Non-Malleable Codes Against Bounded Polynomial Time Tampering

Tal Malkin, Dana Dachman-Soled, Huijia Lin, 2019, IACR Cryptol. ePrint Arch..

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

Amit Sahai, Rafael Pass, Vipul Goyal, 2015, TCC.

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions

Ran Canetti, Rafael Pass, Huijia Lin, 2010, FOCS.

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

Omer Paneth, Ran Canetti, Huijia Lin, 2013, TCC.

Foundations of Homomorphic Secret Sharing

Yuval Ishai, Stefano Tessaro, Niv Gilboa, 2018, ITCS.

Composable Information Gradients in Wireless Sensor Networks

Leonidas J. Guibas, Jie Gao, Maohua Lu, 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation

Huijia Lin, Christian Matt, Huijia Lin, 2018, IACR Cryptol. ePrint Arch..

After-the-Fact Leakage in Public-Key Encryption

Shai Halevi, Huijia Lin, S. Halevi, 2011, IACR Cryptol. ePrint Arch..

Indistinguishability Obfuscation from Well-Founded Assumptions

Amit Sahai, Huijia Lin, Aayush Jain, 2020, IACR Cryptol. ePrint Arch..

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification

Amit Sahai, Aayush Jain, Huijia Lin, 2019, IACR Cryptol. ePrint Arch..

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions

Ran Canetti, Rafael Pass, Huijia Lin, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation

Kai-Min Chung, Rafael Pass, Huijia Lin, 2015, CRYPTO.

Non-malleable Commitments against Quantum Attacks

Nir Bitansky, Huijia Lin, Omri Shmueli, 2021, IACR Cryptol. ePrint Arch..

Counterexamples to New Circular Security Assumptions Underlying iO

Aayush Jain, Huijia Lin, Samuel B. Hopkins, 2021, IACR Cryptol. ePrint Arch..

Multiparty Reusable Non-Interactive Secure Computation from LWE

Ilan Komargodski, Fabrice Benhamouda, Aayush Jain, 2021, IACR Cryptol. ePrint Arch..

Simplifying Constructions and Assumptions for iO

Amit Sahai, Aayush Jain, Huijia Lin, 2019 .

Concurrent Non-Malleable Commitments from One-way Functions

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2007 .