Kang Yang

Orcid: 0000-0002-7453-4043

Affiliations:
  • State Key Laboratory of Cryptology, Beijing, China
  • Institute of Software, Chinese Academy of Sciences, Beijing, China (Ph.D)


According to our database1, Kang Yang authored at least 56 papers between 2013 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
An Efficient Private GPT Never Autoregressively Decodes.
CoRR, May, 2025

Labeled Private Set Intersection From Distributed Point Function.
IEEE Trans. Inf. Forensics Secur., 2025

BitGC Made (More) Efficient.
IACR Cryptol. ePrint Arch., 2025

HELIOS: Multi-Key Fully Homomorphic Encryption with Sublinear Bootstrapping.
IACR Cryptol. ePrint Arch., 2025

Committed Vector Oblivious Linear Evaluation and Its Applications.
IACR Cryptol. ePrint Arch., 2025

DFS: Delegation-friendly zkSNARK and Private Delegation of Provers.
IACR Cryptol. ePrint Arch., 2025

Ajax: Fast Threshold Fully Homomorphic Encryption without Noise Flooding.
IACR Cryptol. ePrint Arch., 2025

Dory: Streaming PCG with Small Memory.
IACR Cryptol. ePrint Arch., 2025

M&M: Secure Two-Party Machine Learning through Efficient Modulus Conversion and Mixed-Mode Protocols.
IACR Cryptol. ePrint Arch., 2025

Simulation-based Security Notion of Correlation Robust Hashing with Applications to MPC.
IACR Cryptol. ePrint Arch., 2025

Stateless Deterministic Multi-party EdDSA Signatures with Low Communication.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

BitGC: Garbled Circuits with 1 Bit per Gate.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Authenticated BitGC for Actively Secure Rate-One 2PC.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Garbled Circuits with 1 Bit per Gate.
IACR Cryptol. ePrint Arch., 2024

On Tweakable Correlation Robust Hashing against Key Leakages.
IACR Cryptol. ePrint Arch., 2024

Stateless Deterministic Multi-Party EdDSA Signatures with Low Communication.
IACR Cryptol. ePrint Arch., 2024

A Simple Post-Quantum Oblivious Transfer Protocol from Mod-LWR.
IACR Cryptol. ePrint Arch., 2024

ReSolveD: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head.
IACR Cryptol. ePrint Arch., 2024

AES-based CCR Hash with High Security and Its Application to Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2024

Lightweight Authentication of Web Data via Garble-Then-Prove.
Proceedings of the 33rd USENIX Security Symposium, 2024

Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Scalable Mixed-Mode MPC.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

sfReSolveD: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Nimbus: Secure and Efficient Two-Party Inference for Transformers.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

The Hardness of LPN over Any Integer Ring and Field for PCG Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Unconditionally Secure MPC for Boolean Circuits With Constant Online Communication.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

Rhombus: Fast Homomorphic Matrix-Vector Multiplication for Secure Two-Party Inference.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Efficient Multi-Party EdDSA Signature With Identifiable Aborts and its Applications to Blockchain.
IEEE Trans. Inf. Forensics Secur., 2023

Unmodified Half-Gates is Adaptively Secure - So is Unmodified Three-Halves.
IACR Cryptol. ePrint Arch., 2023

An Efficient ZK Compiler from SIMD Circuits to General Circuits.
IACR Cryptol. ePrint Arch., 2023

Half-Tree: Halving the Cost of Tree Expansion in COT and DPF.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Concretely efficient secure multi-party computation protocols: survey and more.
Secur. Saf., 2022

Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation.
Proceedings of the Information and Communications Security - 24th International Conference, 2022

AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Non-interactive Zero-Knowledge Proofs to Multiple Verifiers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Direct Anonymous Attestation With Optimal TPM Signing Efficiency.
IEEE Trans. Inf. Forensics Secur., 2021

Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning.
Proceedings of the 30th USENIX Security Symposium, 2021

Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Interactive Proofs for Quantum Black-Box Computations.
IACR Cryptol. ePrint Arch., 2020

Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2020

Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Strong Authentication without Temper-Resistant Hardware and Application to Federated Identities.
Proceedings of the 27th Annual Network and Distributed System Security Symposium, 2020

More Efficient MPC from Improved Triple Generation and Authenticated Garbling.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Ferret: Fast Extension for Correlated OT with Small Communication.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model.
Proceedings of the Information Security and Cryptology - 15th International Conference, 2019

2018
Direct Anonymous Attestation with Optimal TPM Signing Efficiency.
IACR Cryptol. ePrint Arch., 2018

2016
AEP-M: Practical Anonymous E-Payment for Mobile Devices using ARM TrustZone and Divisible E-Cash (Full Version).
IACR Cryptol. ePrint Arch., 2016

AEP-M: Practical Anonymous E-Payment for Mobile Devices Using ARM TrustZone and Divisible E-Cash.
Proceedings of the Information Security - 19th International Conference, 2016

Practical Anonymous Password Authentication and TLS with Anonymous Client Authentication.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
DAA-TZ: An Efficient DAA Scheme for Mobile Devices Using ARM TrustZone.
Proceedings of the Trust and Trustworthy Computing - 8th International Conference, 2015

Security of the SM2 Signature Scheme Against Generalized Key Substitution Attacks.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

2014
DAA-Related APIs in TPM 2.0 Revisited.
Proceedings of the Trust and Trustworthy Computing - 7th International Conference, 2014

ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication.
Proceedings of the Information Security - 17th International Conference, 2014

2013
Certificateless Proxy Re-Encryption Without Pairings.
Proceedings of the Information Security and Cryptology - ICISC 2013, 2013


  Loading...