default search action
Huijia Lin
Huijia (Rachel) Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j6]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. Commun. ACM 67(3): 97-105 (2024) - [c69]Aayush Jain, Huijia Lin, Sagnik Saha:
A Systematic Study of Sparse LWE. CRYPTO (3) 2024: 210-245 - [c68]Yao-Ching Hsieh
, Huijia Lin, Ji Luo
A General Framework for Lattice-Based ABE Using Evasive Inner-Product Functional Encryption. EUROCRYPT (2) 2024: 433-464 - [i56]Yao-Ching Hsieh, Huijia Lin, Ji Luo:
A General Framework for Lattice-Based ABE Using Evasive Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 821 (2024) - [i55]Aayush Jain, Huijia Lin, Sagnik Saha:
A Systematic Study of Sparse LWE. IACR Cryptol. ePrint Arch. 2024: 1589 (2024) - 2023
- [c67]Hanjun Li
LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. ASIACRYPT (1) 2023: 302-334 - [c66]Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala:
From Pseudorandomness to Multi-Group Fairness and Back. COLT 2023: 3566-3614 - [c65]Aayush Jain, Huijia Lin, Ji Luo
The Pseudorandom Oracle Model and Ideal Obfuscation. CRYPTO (4) 2023: 233-262 - [c64]Quang Dao
Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. CRYPTO (2) 2023: 315-348 - [c63]Marshall Ball, Hanjun Li
New Ways to Garble Arithmetic Circuits. EUROCRYPT (2) 2023: 3-34 - [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 - [c60]Yao-Ching Hsieh, Huijia Lin, Ji Luo
Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices. FOCS 2023: 415-434 - [i54]Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala:
New Insights into Multi-Calibration. CoRR abs/2301.08837 (2023) - [i53]Marshall Ball
New Ways to Garble Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2023: 501 (2023) - [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) - [i51]Yao-Ching Hsieh, Huijia Lin, Ji Luo:
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: 1716 (2023) - [i50]Hanjun Li, Huijia Lin, Antigoni Polychroniadou, Stefano Tessaro:
LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. IACR Cryptol. ePrint Arch. 2023: 1936 (2023) - 2022
- [c59]Huijia Lin, Tianren Liu:
Two-Round MPC Without Round Collapsing Revisited - Towards Efficient Malicious Protocols. CRYPTO (1) 2022: 353-382 - [c58]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments Against Quantum Attacks. EUROCRYPT (3) 2022: 519-550 - [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 - [c56]Hanjun Li
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security. TCC (1) 2022: 680-710 - [c55]Sujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal, Amr El Abbadi, Huijia Lin, Stefano Tessaro, Victor Zakhary:
QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore. USENIX Security Symposium 2022: 3665-3682 - [i49]Hanjun Li, Huijia Lin, Ji Luo:
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security. IACR Cryptol. ePrint Arch. 2022: 659 (2022) - [i48]Sujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal, Amr El Abbadi, Huijia Lin, Stefano Tessaro, Victor Zakhary:
QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore. IACR Cryptol. ePrint Arch. 2022: 691 (2022) - [i47]Huijia Lin, Tianren Liu:
Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols. IACR Cryptol. ePrint Arch. 2022: 944 (2022) - [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
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification. EUROCRYPT (3) 2021: 97-126 - [c52]Alex B. Grilo
Oblivious Transfer Is in MiniQCrypt. EUROCRYPT (2) 2021: 531-561 - [c51]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) 2021: 724-753 - [c50]Huijia (Rachel) Lin:
Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk). FSTTCS 2021: 4:1-4:1 - [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) - [i41]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments against Quantum Attacks. IACR Cryptol. ePrint Arch. 2021: 920 (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
- [j5]Huijia Lin, Rafael Pass
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. SIAM J. Comput. 49(4) (2020) - [c48]Huijia Lin, Ji Luo
Succinct and Adaptively Secure ABE for ABP from k-Lin. ASIACRYPT (3) 2020: 437-466 - [c47]Huijia Lin, Ji Luo
Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and Towards NL. EUROCRYPT (3) 2020: 247-277 - [c46]Fabrice Benhamouda, Huijia Lin:
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. TCC (2) 2020: 349-378 - [c45]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More. TCC (2) 2020: 502-531 - [i39]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. CoRR abs/2008.09317 (2020) - [i38]Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer is in MiniQCrypt. CoRR abs/2011.14980 (2020) - [i37]Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from Well-Founded Assumptions. Electron. Colloquium Comput. Complex. TR20 (2020) - [i36]Fabrice Benhamouda, Huijia Lin:
Multiparty Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2020: 221 (2020) - [i35]Huijia Lin, Ji Luo:
Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL. IACR Cryptol. ePrint Arch. 2020: 318 (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) - [i32]Huijia Lin, Ji Luo:
Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin. IACR Cryptol. ePrint Arch. 2020: 1139 (2020) - [i31]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More. IACR Cryptol. ePrint Arch. 2020: 1431 (2020) - [i30]Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer is in MiniQCrypt. IACR Cryptol. ePrint Arch. 2020: 1500 (2020)
2010 – 2019
- 2019
- [c44]Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt
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
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O. EUROCRYPT (1) 2019: 251-281 - [c42]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) 2019: 501-530 - [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) - 2018
- [j4]Nir Bitansky, Ran Canetti, Sanjam Garg
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [c41]Victor Zakhary, Cetin Sahin, Amr El Abbadi, Huijia Lin, Stefano Tessaro:
Pharos: Privacy Hazards of Replicating ORAM Stores. EDBT 2018: 702-705 - [c40]Fabrice Benhamouda
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. EUROCRYPT (2) 2018: 500-532 - [c39]Elette Boyle, Niv Gilboa
Foundations of Homomorphic Secret Sharing. ITCS 2018: 21:1-21:21 - [c38]Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. TCC (1) 2018: 175-205 - [c37]Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-malleable Commitments. TCC (1) 2018: 209-234 - [i26]Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2018: 613 (2018) - [i25]Huijia Lin, Christian Matt:
Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2018: 646 (2018) - [i24]Marshall Ball
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018: 1015 (2018) - 2017
- [j3]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. J. Cryptol. 30(4): 989-1066 (2017) - [c36]Huijia Lin:
Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs. CRYPTO (1) 2017: 599-629 - [c35]Huijia Lin, Stefano Tessaro:
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs. CRYPTO (1) 2017: 630-660 - [c34]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. EUROCRYPT (2) 2017: 3-29 - [c33]Huijia Lin, Rafael Pass
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. FOCS 2017: 576-587 - [c32]Cetin Sahin, Aaron Magat, Victor Zakhary, Amr El Abbadi, Huijia (Rachel) Lin, Stefano Tessaro:
Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses. ICDE 2017: 1377-1378 - [c31]Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. TCC (1) 2017: 776-809 - [i23]Huijia Lin, Stefano Tessaro:
Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs. IACR Cryptol. ePrint Arch. 2017: 250 (2017) - [i22]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2017: 273 (2017) - [i21]Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. IACR Cryptol. ePrint Arch. 2017: 944 (2017) - [i20]Fabrice Benhamouda, Huijia Lin:
k-Round MPC from k-Round OT via Garbled Interactive Circuits. IACR Cryptol. ePrint Arch. 2017: 1125 (2017) - [i19]Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro:
Foundations of Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1248 (2017) - 2016
- [j2]Ran Canetti, Huijia Lin, Rafael Pass
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. SIAM J. Comput. 45(5): 1793-1834 (2016) - [c30]Huijia Lin:
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes. EUROCRYPT (1) 2016: 28-57 - [c29]Huijia Lin, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings. FOCS 2016: 11-20 - [c28]Huijia Lin, Rafael Pass
Indistinguishability Obfuscation with Non-trivial Efficiency. Public Key Cryptography (2) 2016: 447-462 - [c27]Cetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin, Stefano Tessaro:
TaoStore: Overcoming Asynchronicity in Oblivious Data Storage. IEEE Symposium on Security and Privacy 2016: 198-217 - [c26]Prabhanjan Ananth, Yu-Chi Chen
Delegating RAM Computations with Adaptive Soundness and Privacy. TCC (B2) 2016: 3-30 - [c25]Huijia Lin, Rafael Pass
Output-Compressing Randomized Encodings and Applications. TCC (A1) 2016: 96-124 - [c24]Binyi Chen, Huijia Lin, Stefano Tessaro:
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. TCC (A2) 2016: 205-234 - [i18]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Indistinguishability Obfuscation with Non-trivial Efficiency. IACR Cryptol. ePrint Arch. 2016: 6 (2016) - [i17]Huijia Lin:
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes. IACR Cryptol. ePrint Arch. 2016: 257 (2016) - [i16]Huijia Lin, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings. IACR Cryptol. ePrint Arch. 2016: 795 (2016) - [i15]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 962 (2016) - [i14]Huijia Lin:
Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs. IACR Cryptol. ePrint Arch. 2016: 1096 (2016) - 2015
- [j1]Huijia Lin, Rafael Pass
Constant-Round Nonmalleable Commitments from Any One-Way Function. J. ACM 62(1): 5:1-5:30 (2015) - [c23]Kai-Min Chung
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation. CRYPTO (1) 2015: 287-307 - [c22]Irit Dinur
The Computational Benefit of Correlated Instances. ITCS 2015: 219-228 - [c21]Nir Bitansky, Sanjam Garg
Succinct Randomized Encodings and their Applications. STOC 2015: 439-448 - [c20]Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. TCC (1) 2015: 260-289 - [c19]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. TCC (2) 2015: 468-497 - [i13]Nir Bitansky, Sanjam Garg
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2015: 356 (2015) - [i12]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Output-Compressing Randomized Encodings and Applications. IACR Cryptol. ePrint Arch. 2015: 720 (2015) - [i11]Binyi Chen, Huijia Lin, Stefano Tessaro:
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. IACR Cryptol. ePrint Arch. 2015: 1053 (2015) - [i10]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. IACR Cryptol. ePrint Arch. 2015: 1082 (2015) - 2014
- [c18]Nir Bitansky, Dana Dachman-Soled, Huijia Lin:
Leakage-Tolerant Computation with Input-Independent Preprocessing. CRYPTO (2) 2014: 146-163 - [i9]Irit Dinur, Shafi Goldwasser, Huijia Lin:
The Computational Benefit of Correlated Instances. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. IACR Cryptol. ePrint Arch. 2014: 580 (2014) - [i7]Huijia Lin, Rafael Pass:
Succinct Garbling Schemes and Applications. IACR Cryptol. ePrint Arch. 2014: 766 (2014) - [i6]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. IACR Cryptol. ePrint Arch. 2014: 882 (2014) - [i5]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 991 (2014) - 2013
- [c17]Huijia Lin, Stefano Tessaro:
Amplification of Chosen-Ciphertext Security. EUROCRYPT 2013: 503-519 - [c16]Kai-Min Chung
Constant-Round Concurrent Zero Knowledge from P-Certificates. FOCS 2013: 50-59 - [c15]Ran Canetti, Huijia Lin, Rafael Pass
From Unprovability to Environmentally Friendly Protocols. FOCS 2013: 70-79 - [c14]Kai-Min Chung, Huijia Lin, Mohammad Mahmoody
On the power of nonuniformity in proofs of security. ITCS 2013: 389-400 - [c13]Ran Canetti, Huijia Lin, Omer Paneth:
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. TCC 2013: 80-99 - 2012
- [b1]Huijia Lin:
Concurrent Security. Cornell University, USA, 2012 - [c12]Rafael Pass
A Unified Framework for UC from Only OT. ASIACRYPT 2012: 699-717 - [c11]Huijia Lin, Rafael Pass
Black-Box Constructions of Composable Protocols without Set-Up. CRYPTO 2012: 461-478 - [i4]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2012: 563 (2012) - 2011
- [c10]Huijia Lin, Rafael Pass
Constant-round non-malleable commitments from any one-way function. STOC 2011: 705-714 - [c9]Shai Halevi, Huijia Lin:
After-the-Fact Leakage in Public-Key Encryption. TCC 2011: 107-124 - [c8]Huijia Lin, Rafael Pass
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. TCC 2011: 274-292 - [i3]Shai Halevi, Huijia Lin:
After-the-Fact Leakage in Public-Key Encryption. IACR Cryptol. ePrint Arch. 2011: 11 (2011) - [i2]Shafi Goldwasser, Huijia Lin, Aviad Rubinstein:
Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. IACR Cryptol. ePrint Arch. 2011: 456 (2011) - 2010
- [c7]Huijia Lin, Rafael Pass
Concurrent Non-Malleable Zero Knowledge Proofs. CRYPTO 2010: 429-446 - [c6]Ran Canetti, Huijia Lin, Rafael Pass
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. FOCS 2010: 541-550 - [i1]Huijia Lin, Rafael Pass:
Constant-round Non-Malleable Commitments from Any One-Way Function. IACR Cryptol. ePrint Arch. 2010: 483 (2010)
2000 – 2009
- 2009
- [c5]Huijia Lin, Rafael Pass
A unified framework for concurrent security: universal composability from stand-alone non-malleability. STOC 2009: 179-188 - [c4]Huijia Lin, Rafael Pass
Non-malleability amplification. STOC 2009: 189-198 - 2008
- [c3]Huijia Lin, Maohua Lu, Nikola Milosavljevic, Jie Gao, Leonidas J. Guibas:
Composable Information Gradients in Wireless Sensor Networks. IPSN 2008: 121-132 - [c2]Huijia Lin, Rafael Pass
Concurrent Non-malleable Commitments from Any One-Way Function. TCC 2008: 571-588 - 2007
- [c1]David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh, Rob Johnson, Huijia Lin:
RICH: Automatically Protecting Against Integer-Based Vulnerabilities. NDSS 2007
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-11-18 20:45 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: