dblp: Huijia Lin

dblp: Huijia Lin
default search action
combined dblp search
author search
venue search
publication search
ask others
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID
Persons
showing all
??
records
2026
[j7]
Aayush Jain
Huijia Lin
Amit Sahai
Indistinguishability Obfuscation from Well-Founded Assumptions.
J. ACM
73
1:1-1:30
2026
[e1]
Benny Applebaum
Huijia (Rachel) Lin
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part IV.
Lecture Notes in Computer Science
16271,
Springer
2026
, ISBN
978-3-032-12289-6
[contents]
[i65]
Huijia Lin
Kameron Shahabi
Min Jae Song
Unforgeable Watermarks for Language Models via Robust Signatures.
CoRR
abs/2602.15323
2026
[i64]
Huijia Lin
Kameron Shahabi
Min Jae Song
Unforgeable Watermarks for Language Models via Robust Signatures.
IACR Cryptol. ePrint Arch.
2026
282
2026
[i63]
Jaehyung Kim
Hanjun Li
Huijia Lin
Zeyu Liu
SIMD HSS and aHMAC from Interval Encoding with Application to One-Bit-Per-Gate Garbling.
IACR Cryptol. ePrint Arch.
2026
485
2026
2025
[c74]
Yao-Ching Hsieh
Aayush Jain
Huijia Lin
Lattice-Based Post-quantum iO from Circular Security with Random Opening Assumption.
CRYPTO (7)
2025
3-38
[c73]
Yuval Ishai
Hanjun Li
Huijia Lin
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing.
CRYPTO (4)
2025
390-425
[c72]
Marian Dietz
Hanjun Li
Huijia Lin
TinyLabels: How to Compress Garbled Circuit Input Labels, Efficiently.
EUROCRYPT (6)
2025
245-274
[c71]
Yuval Ishai
Hanjun Li
Huijia Lin
Succinct Homomorphic MACs from Groups and Applications.
FOCS
2025
2505-2545
[i62]
Yao-Ching Hsieh
Aayush Jain
Huijia Lin
Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions).
IACR Cryptol. ePrint Arch.
2025
390
2025
[i61]
Yuval Ishai
Hanjun Li
Huijia Lin
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch.
2025
442
2025
[i60]
Aayush Jain
Huijia Lin
Nuozhou Sun
A New Approach to Large Party Beaver-Style MPC with Small Computational Overhead.
IACR Cryptol. ePrint Arch.
2025
2305
2025
[i59]
Hanjun Li
Huijia Lin
George Lu
Succinct Garbled Circuits with Low-Depth Garbling Algorithms.
IACR Cryptol. ePrint Arch.
2025
2308
2025
2024
[j6]
Aayush Jain
Huijia Lin
Amit Sahai
Indistinguishability Obfuscation from Well-Founded Assumptions.
Commun. ACM
67
97-105
2024
[c70]
Aayush Jain
Huijia Lin
Sagnik Saha
A Systematic Study of Sparse LWE.
CRYPTO (3)
2024
210-245
[c69]
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
[c68]
Yevgeniy Dodis
Aayush Jain
Huijia Lin
Ji Luo
Daniel Wichs
How to Simulate Random Oracles with Auxiliary Input.
FOCS
2024
1207-1230
[i58]
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
[i57]
Aayush Jain
Huijia Lin
Sagnik Saha
A Systematic Study of Sparse LWE.
IACR Cryptol. ePrint Arch.
2024
1589
2024
[i56]
Marian Dietz
Hanjun Li
Huijia Lin
How to Compress Garbled Circuit Input Labels, Efficiently.
IACR Cryptol. ePrint Arch.
2024
2048
2024
[i55]
Yuval Ishai
Hanjun Li
Huijia Lin
Succinct Partial Garbling from Groups and Applications.
IACR Cryptol. ePrint Arch.
2024
2073
2024
2023
[c67]
Hanjun Li
Huijia Lin
Antigoni Polychroniadou
Stefano Tessaro
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
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
[c63]
Marshall Ball
Hanjun Li
Huijia Lin
Tianren Liu
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
Hanjun Li
Huijia Lin
Tianren Liu
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 NC
EUROCRYPT (1)
2022
670-699
[c56]
Hanjun Li
Huijia Lin
Ji Luo
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
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
[c52]
Alex B. Grilo
Huijia Lin
Fang Song
Vinod Vaikuntanathan
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
Pratik Soni
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.
SIAM J. Comput.
49
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 NC
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
Article TR20-126
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
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
[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
Justin Holmgren
Abhishek Jain
Huijia Lin
Rafael Pass
Sidharth Telang
Vinod Vaikuntanathan
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput.
47
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
Huijia Lin
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits.
EUROCRYPT (2)
2018
500-532
[c39]
Elette Boyle
Niv Gilboa
Yuval Ishai
Huijia Lin
Stefano Tessaro
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
Dana Dachman-Soled
Mukul Kulkarni
Huijia Lin
Tal Malkin
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
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
Pratik Soni
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
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
Karn Seth
Sidharth Telang
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
Kai-Min Chung
Huijia Lin
Wei-Kai Lin
Delegating RAM Computations with Adaptive Soundness and Privacy.
TCC (B2)
2016
3-30
[c25]
Huijia Lin
Rafael Pass
Karn Seth
Sidharth Telang
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
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
5:1-5:30
2015
[c23]
Kai-Min Chung
Huijia Lin
Rafael Pass
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation.
CRYPTO (1)
2015
287-307
[c22]
Irit Dinur
Shafi Goldwasser
Huijia Lin
The Computational Benefit of Correlated Instances.
ITCS
2015
219-228
[c21]
Nir Bitansky
Sanjam Garg
Huijia Lin
Rafael Pass
Sidharth Telang
Succinct Randomized Encodings and their Applications.
STOC
2015
439-448
[c20]
Vipul Goyal
Huijia Lin
Omkant Pandey
Rafael Pass
Amit Sahai
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
Huijia Lin
Rafael Pass
Sidharth Telang
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
Article TR14-083
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
Huijia Lin
Rafael Pass
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
Rafael Pass
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
Huijia Lin
Muthuramakrishnan Venkitasubramaniam
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
Wei-Lung Dustin Tseng
Muthuramakrishnan Venkitasubramaniam
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
2009
[c5]
Huijia Lin
Rafael Pass
Muthuramakrishnan Venkitasubramaniam
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
Muthuramakrishnan Venkitasubramaniam
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
Amr El Abbadi
[c55]
[i48]
[c41]
[c32]
[c27]
Divyakant Agrawal
[c55]
[i48]
Prabhanjan Vijendra Ananth
aka: Prabhanjan Ananth
[c44]
[i29]
[c26]
[i10]
Benny Applebaum
[e1]
Marshall Ball
[c63]
[i53]
[c42]
[i24]
Fabrice Benhamouda
[c51]
[i43]
[c46]
[i36]
[c40]
[c38]
[i20]
Nir Bitansky
[c58]
[i41]
[j4]
[c37]
[i26]
[j3]
[c34]
[i15]
[c21]
[i13]
[c18]
[i8]
Elette Boyle
[c39]
[i19]
David Brumley
[c1]
10
Ran Canetti
[j4]
[j3]
[j2]
[c19]
[i8]
[i6]
[c15]
[c13]
[c6]
11
Binyi Chen
[c24]
[i11]
12
Yu-Chi Chen
0001
[c26]
[i10]
13
Alessandro Chiesa
[j3]
[i8]
14
Tzi-cker Chiueh
[c1]
15
Kai-Min Chung
[c26]
[c23]
[i10]
[i5]
[c16]
[c14]
[i4]
16
Dana Dachman-Soled
[c42]
[i24]
[c18]
17
Quang Dao
[c64]
[i52]
18
Marian Dietz
[c72]
[i56]
19
Irit Dinur
[c22]
[i9]
20
Yevgeniy Dodis
[c68]
21
Cynthia Dwork
[c66]
[i54]
22
Jie Gao
0001
[c3]
23
Sanjam Garg
[j4]
[c21]
[i13]
24
Romain Gay
[c53]
[i34]
25
Niv Gilboa
[c39]
[i19]
26
Shafi Goldwasser
[j3]
[c22]
[i9]
[i8]
[i2]
27
Vipul Goyal
[c20]
28
Alex Bredariol Grilo
aka: Alex B. Grilo
[c52]
[i38]
[i30]
29
Leonidas J. Guibas
[c3]
30
Shai Halevi
[c9]
[i3]
31
Justin Holmgren
[j4]
32
Sam Hopkins
0001
aka: Samuel B. Hopkins
0001
[c54]
[i42]
33
Yao-Ching Hsieh
[c74]
[i62]
[c69]
[i58]
[c60]
[i51]
34
Seif Ibrahim
[c55]
[i48]
35
Yuval Ishai
[c73]
[c71]
[i61]
[i55]
[c64]
[i52]
[c39]
[i19]
36
Aayush Jain
[j7]
[c74]
[i62]
[i60]
[j6]
[c70]
[c68]
[i57]
[c65]
[c64]
[c62]
[c61]
[i52]
[c57]
[i46]
[i45]
[i44]
[c54]
[c53]
[c51]
[c49]
[i43]
[i42]
[i40]
[i39]
[i37]
[i34]
[i33]
[c44]
[c43]
[i29]
[i28]
[i27]
37
Abhishek Jain
0002
[j4]
38
Rob Johnson
0001
[c1]
39
Jaehyung Kim
[i63]
40
Susumu Kiyoshima
[c31]
[i21]
41
Ilan Komargodski
[c51]
[i43]
42
Mukul Kulkarni
[c42]
[i24]
43
Daniel Lee
[c66]
[i54]
44
Hanjun Li
0001
[i63]
[c73]
[c72]
[c71]
[i61]
[i59]
[i56]
[i55]
[c67]
[c63]
[i53]
[i50]
[c56]
[i49]
45
Wei-Kai Lin
[c26]
[i10]
46
Tianren Liu
[c63]
[i53]
[c59]
[i47]
[c45]
[i31]
47
Zeyu Liu
[i63]
48
Paul Lou
[c62]
[i44]
49
George Lu
[i59]
50
Maohua Lu
[c3]
51
Ji Luo
0002
[c69]
[c68]
[i58]
[c65]
[c61]
[c60]
[i51]
[c56]
[i49]
[i46]
[i45]
[c48]
[c47]
[i35]
[i32]
52
Aaron Magat
[c32]
53
Mohammad Mahmoody
[c14]
54
Sujaya Maiyya
[c55]
[i48]
55
Tal Malkin
[c42]
[i24]
56
Christian Matt
0002
[c44]
[c43]
[i29]
[i28]
[i25]
57
Nikola Milosavljevic
[c3]
58
Omkant Pandey
[c20]
59
Omer Paneth
[c34]
[i15]
[c13]
60
Rafael Pass
[j5]
[j4]
[c33]
[i22]
[j2]
[c28]
[c25]
[i18]
[j1]
[c23]
[c21]
[c20]
[i13]
[i12]
[i7]
[i5]
[c16]
[c15]
[c14]
[c12]
[c11]
[i4]
[c10]
[c8]
[c7]
[c6]
[i1]
[c5]
[c4]
[c2]
61
Antigoni Polychroniadou
[c67]
[i50]
[c38]
62
Aviad Rubinstein
[j3]
[i8]
[i2]
63
Sagnik Saha
[c70]
[i57]
64
Amit Sahai
[j7]
[j6]
[c62]
[c57]
[i44]
[c53]
[c49]
[i40]
[i39]
[i37]
[i34]
[i33]
[c44]
[c43]
[i29]
[i28]
[i27]
[c20]
65
Cetin Sahin
[c41]
[c32]
[c27]
66
Caitlin Scarberry
[c55]
[i48]
67
Karn Seth
[c28]
[c25]
[i18]
[i12]
68
Kameron Shahabi
[i65]
[i64]
69
Omri Shmueli
[c58]
[i41]
70
Dawn Song
aka: Dawn Xiaodong Song
[c1]
71
Fang Song
0001
[c52]
[i38]
[i30]
72
Min Jae Song
[i65]
[i64]
73
Pratik Soni
[j5]
[c33]
[i22]
74
Nuozhou Sun
[i60]
75
Pranay Tankala
[c66]
[i54]
76
Sidharth Telang
[j4]
[c28]
[c25]
[i18]
[c21]
[i13]
[i12]
77
Stefano Tessaro
[c67]
[i50]
[c55]
[i48]
[c41]
[c39]
[c35]
[c32]
[i23]
[i19]
[c27]
[c24]
[c19]
[i11]
[i6]
[c17]
78
Eran Tromer
[j3]
[i8]
79
Wei-Lung Dustin Tseng
[c7]
80
Vinod Vaikuntanathan
[c52]
[i38]
[i30]
[j4]
[c29]
[i16]
[c19]
[i6]
81
Muthuramakrishnan Venkitasubramaniam
[c38]
[c31]
[i21]
[c12]
[c7]
[c5]
[c2]
82
Hoeteck Wee
[c45]
[i31]
83
Daniel Wichs
[c68]
[c65]
[i46]
84
Victor Zakhary
[c55]
[i48]
[c41]
[c32]
[c27]
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).
load links from unpaywall.org
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).
load content from archive.org
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
load data from openalex.org
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
dblp team
all metadata released as
open data
under
CC0 1.0 license
see also:
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: