Yan Huang

Orcid: 0000-0002-5169-4319

Affiliations:
  • Indiana University Bloomington, USA


According to our database1, Yan Huang authored at least 36 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Dubhe: Succinct Zero-Knowledge Proofs for Standard AES and related Applications.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Efficient and Precise Secure Generalized Edit Distance and Beyond.
IEEE Trans. Dependable Secur. Comput., 2022

2021
DNSonChain: Delegating Privacy-Preserved DNS Resolution to Blockchain.
Proceedings of the 29th IEEE International Conference on Network Protocols, 2021

Hash-Enabled Garbling and the Insecurity of Free-Hashing Garbled Circuits.
Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021

2020
Practical MPC+FHE with Applications in Secure Multi-PartyNeural Network Evaluation.
IACR Cryptol. ePrint Arch., 2020

2019
Uncovering Information Flow Policy Violations in C Programs.
CoRR, 2019

Uncovering Information Flow Policy Violations in C Programs (Extended Abstract).
Proceedings of the Computer Security - ESORICS 2019, 2019

Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

FlowNotation: An Annotation System for Statically Enforcing Information Flow Policies in C.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Efficient Privacy-Preserving Edit Distance and Beyond.
IACR Cryptol. ePrint Arch., 2017

Faster LEGO-based Secure Computation without Homomorphic Commitments.
IACR Cryptol. ePrint Arch., 2017

Cost-Aware Cut-and-Choose Games with Applications in Cryptography and Prefix-Free Codes.
IACR Cryptol. ePrint Arch., 2017

Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
The Cut-and-Choose Game and Its Application to Cryptographic Protocols.
Proceedings of the 25th USENIX Security Symposium, 2016

2015
iDASH Secure Genome Analysis Competition Using ObliVM.
IACR Cryptol. ePrint Arch., 2015

Revisiting LEGOs: Optimizations, Analysis, and their Limit.
IACR Cryptol. ePrint Arch., 2015

Amortizing Garbled Circuits.
IACR Cryptol. ePrint Arch., 2015

ObliVM: A Programming Framework for Secure Computation.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Practicing Oblivious Access on Cloud Storage: the Gap, the Fallacy, and the New Way Forward.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Oblivious Data Structures.
IACR Cryptol. ePrint Arch., 2014

SCORAM: Oblivious RAM for Secure Computation.
IACR Cryptol. ePrint Arch., 2014

Implementing Cryptographic Program Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Automating Efficient RAM-Model Secure Computation.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

A secure computation framework for SDNs.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

Oblivious Data Structures.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.
IACR Cryptol. ePrint Arch., 2013

2012
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution.
Proceedings of the IEEE Symposium on Security and Privacy, 2012

Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Proceedings of the 19th Annual Network and Distributed System Security Symposium, 2012

2011
Faster Secure Two-Party Computation Using Garbled Circuits.
Proceedings of the 20th USENIX Security Symposium, 2011

Privacy-Preserving Applications on Smartphones.
Proceedings of the 6th USENIX Workshop on Hot Topics in Security, 2011

Efficient Privacy-Preserving Biometric Identification.
Proceedings of the Network and Distributed System Security Symposium, 2011

Efficient Secure Computation with Garbled Circuits.
Proceedings of the Information Systems Security - 7th International Conference, 2011

Private Editing Using Untrusted Cloud Services.
Proceedings of the 31st IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2011 Workshops), 2011


  Loading...