Ning Luo

Orcid: 0000-0002-0638-037X

Affiliations:
  • Yale University, New Haven, CT, USA
  • University of Illinois Urbana–Champaign, IL, USA


According to our database1, Ning Luo authored at least 15 papers between 2020 and 2025.

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

2025
Founding Zero-Knowledge Proofs of Training on Optimum Vicinity.
IACR Cryptol. ePrint Arch., 2025

Founding Zero-Knowledge Proof of Training on Optimum Vicinity.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
YMMNet: A More Accurate and Lightweight Detector of Illegal Buildings for Smart Cities.
IEEE Trans. Consumer Electron., August, 2024

A semi-supervised mixture model of visual language multitask for vehicle recognition.
Appl. Soft Comput., 2024

ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge.
Proceedings of the 33rd USENIX Security Symposium, 2024

Privacy-Preserving Regular Expression Matching Using TNFA.
Proceedings of the Computer Security - ESORICS 2024, 2024

Poster: BlindMarket: A Trustworthy Chip Designs Marketplace for IP Vendors and Users.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
CRMNet: Development of a Deep-Learning-Based Anchor-Free Detection Method for Illegal Building Objects.
Int. J. Pattern Recognit. Artif. Intell., May, 2023

Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata.
IACR Cryptol. ePrint Arch., 2023

Ou: Automating the Parallelization of Zero-Knowledge Protocols.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
IVeri: Privacy-Preserving Interdomain Verification.
CoRR, 2022

ppSAT: Towards Two-Party Private SAT Solving.
Proceedings of the 31st USENIX Security Symposium, 2022

Proving UNSAT in Zero Knowledge.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Looking for the Maximum Independent Set: A New Perspective on the Stable Path Problem.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020
Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms.
Proceedings of the WPES'20: Proceedings of the 19th Workshop on Privacy in the Electronic Society, 2020


  Loading...