Yu Yu

Orcid: 0000-0002-9278-4521

Affiliations:
  • Shanghai Jiaotong University, Department of Computer Science and Engineering, China
  • Westone Cryptologic Research Center, Beijing, China (former)
  • Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China (2012 - 2013)
  • East China Normal University, Department of Computer Science and Technology, Shanghai, China (2010 - 2011)
  • Nanyang Technological University, School of Computer Engineering, Singapore (PhD 2006)


According to our database1, Yu Yu authored at least 101 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Unconditionally secure MPC for Boolean circuits with constant online communication.
IACR Cryptol. ePrint Arch., 2024

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

The Multi-user Constrained PRF Security of Generalized GGM Trees for MPC and Hierarchical Wallets.
IACR Cryptol. ePrint Arch., 2024

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

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

A system capable of verifiably and privately screening global DNA synthesis.
CoRR, 2024

2023
The Multi-User Constrained Pseudorandom Function Security of Generalized GGM Trees for MPC and Hierarchical Wallets.
ACM Trans. Priv. Secur., August, 2023

Efficient Private Circuits with Precomputation.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Algebraic Attacks on Round-Reduced RAIN and Full AIM-III.
IACR Cryptol. ePrint Arch., 2023

Revisiting the Constant-sum Winternitz One-time Signature with Applications to SPHINCS+ and XMSS.
IACR Cryptol. ePrint Arch., 2023

Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations.
IACR Cryptol. ePrint Arch., 2023

Lightweight Authentication of Web Data via Garble-Then-Prove.
IACR Cryptol. ePrint Arch., 2023

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

Actively Secure Half-Gates with Minimum Overhead under Duplex Networks.
IACR Cryptol. ePrint Arch., 2023

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

Medusa Attack: Exploring Security Hazards of In-App QR Code Scanning.
Proceedings of the 32nd USENIX Security Symposium, 2023

Bicoptor: Two-round Secure Three-party Non-linear Computation without Preprocessing for Privacy-preserving Machine Learning.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

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

Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to SPHINCS<sup>+</sup> and XMSS.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Side-Channel Masking with Common Shares.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

HEAD: an FHE-based Outsourced Computation Protocol with Compact Storage and Efficient Computation.
IACR Cryptol. ePrint Arch., 2022

SPHINCS-α: A Compact Stateless Hash-Based Signature Scheme.
IACR Cryptol. ePrint Arch., 2022

Maliciously Secure Multi-Party PSI with Lower Bandwidth and Faster Computation.
IACR Cryptol. ePrint Arch., 2022

The Hardness of LPN over Any Integer Ring and Field for PCG Applications.
IACR Cryptol. ePrint Arch., 2022

A Third is All You Need: Extended Partial Key Exposure Attack on CRT-RSA with Additive Exponent Blinding.
IACR Cryptol. ePrint Arch., 2022

On the Hardness of Sparsely Learning Parity with Noise.
Comput. J., 2022

GRUZ: Practical Resource Fair Exchange Without Blockchain.
Proceedings of the Information Security - 25th International Conference, 2022

2021
Provable Security of SP Networks with Partial Non-Linear Layers.
IACR Trans. Symmetric Cryptol., 2021

An improved algorithm for learning sparse parities in the presence of noise.
Theor. Comput. Sci., 2021

Learning Parity with Physical Noise: Imperfections, Reductions and FPGA Prototype.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Facial Template Protection via Lattice-based Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs.
IACR Cryptol. ePrint Arch., 2021

A Non-heuristic Approach to Time-space Tradeoffs and Optimizations for BKW.
IACR Cryptol. ePrint Arch., 2021

MPC-in-Multi-Heads: A Multi-Prover Zero-Knowledge Proof System - (or: How to Jointly Prove Any NP Statements in ZK).
Proceedings of the Computer Security - ESORICS 2021, 2021

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

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

Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN.
IACR Cryptol. ePrint Arch., 2020

Packed Multiplication: How to Amortize the Cost of Side-channel Masking ?
IACR Cryptol. ePrint Arch., 2020

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact.
IACR Cryptol. ePrint Arch., 2020

A Not-So-Trival Replay Attack Against DH-PSI.
IACR Cryptol. ePrint Arch., 2020

Improved lattice-based CCA2-secure PKE in the standard model.
Sci. China Inf. Sci., 2020

Advances in security research in the Asiacrypt region.
Commun. ACM, 2020

A Lattice-Based Key-Insulated and Privacy-Preserving Signature Scheme with Publicly Derived Public Key.
Proceedings of the Computer Security - ESORICS 2020, 2020

LEAF: A Faster Secure Search Algorithm via Localization, Extraction, and Reconstruction.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Provable Order Amplification for Code-Based Masking: How to Avoid Non-Linear Leakages Due to Masked Operations.
IEEE Trans. Inf. Forensics Secur., 2019

New zero-sum distinguishers on full 24-round Keccak-f using the division property.
IET Inf. Secur., 2019

On the (Quantum) Random Oracle Methodology: New Separations and More.
IACR Cryptol. ePrint Arch., 2019

Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes.
IACR Cryptol. ePrint Arch., 2019

Efficient Side-Channel Secure Message Authentication with Better Bounds.
IACR Cryptol. ePrint Arch., 2019

Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting).
IACR Cryptol. ePrint Arch., 2019

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers.
IACR Cryptol. ePrint Arch., 2019

Basing Diversified Services of Complex IIoT Applications on Scalable Block Graph Platform.
IEEE Access, 2019

Collision Resistant Hashing from Sub-exponential Learning Parity with Noise.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Strong Leakage and Tamper-Resilient PKE from Refined Hash Proof System.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
Ridge-Based DPA: Improvement of Differential Power Analysis For Nanoscale Chips.
IEEE Trans. Inf. Forensics Secur., 2018

Connected Vehicles' Security from the Perspective of the In-Vehicle Network.
IEEE Netw., 2018

Valiant's Universal Circuits Revisited: an Overall Improvement and a Lower Bound.
IACR Cryptol. ePrint Arch., 2018

Goshawk: A Novel Efficient, Robust and Flexible Blockchain Protocol.
IACR Cryptol. ePrint Arch., 2018

Anonymity for Bitcoin From Secure Escrow Address.
IEEE Access, 2018

Passwords in the Air: Harvesting Wi-Fi Credentials from SmartCfg Provisioning.
Proceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks, 2018

On the Hardness of Learning Parity with Noise over Rings.
Proceedings of the Provable Security, 2018

2017
Embedded Device Forensics and Security.
ACM Trans. Embed. Comput. Syst., 2017

1-Resilient Boolean Functions on Even Variables with Almost Perfect Algebraic Immunity.
Secur. Commun. Networks, 2017

Public key encryption resilient to leakage and tampering attacks.
J. Comput. Syst. Sci., 2017

Two-Round PAKE from Approximate SPH and Instantiations from Lattices.
IACR Cryptol. ePrint Arch., 2017

Collision Resistant Hashing from Learning Parity with Noise.
IACR Cryptol. ePrint Arch., 2017

Characterizing the semantics of passwords: The role of Pinyin for Chinese Netizens.
Comput. Stand. Interfaces, 2017

VulDigger: A Just-in-Time and Cost-Aware Tool for Digging Vulnerability-Contributing Changes.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Ridge-Based Profiled Differential Power Analysis.
Proceedings of the Topics in Cryptology - CT-RSA 2017, 2017

Trace Augmentation: What Can Be Done Even Before Preprocessing in a Profiled SCA?
Proceedings of the Smart Card Research and Advanced Applications, 2017

2016
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN.
IACR Cryptol. ePrint Arch., 2016

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN.
IACR Cryptol. ePrint Arch., 2016

Evaluation and Improvement of Generic-Emulating DPA Attacks.
IACR Cryptol. ePrint Arch., 2016

RKA-Secure Public Key Encryptions Against Efficiently Invertible Functions.
Comput. J., 2016

On the Robustness of Learning Parity with Noise.
Proceedings of the Information and Communications Security - 18th International Conference, 2016

Inner Product Masking for Bitslice Ciphers and Security Order Amplification for Linear Leakages.
Proceedings of the Smart Card Research and Advanced Applications, 2016

Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations.
Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions.
Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

2015
Pseudorandom generators from regular one-way functions: New constructions with improved parameters.
Theor. Comput. Sci., 2015

Signcryption KEM/tag-KEM, revisited.
Secur. Commun. Networks, 2015

The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Small Tweaks Do Not Help: Differential Power Analysis of MILENAGE Implementations in 3G/4G USIM Cards.
Proceedings of the Computer Security - ESORICS 2015, 2015

(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Robust password changing and DoS resilience for human-centric password authentication.
Secur. Commun. Networks, 2014

(Almost) Optimal Constructions of UOWHFs from 1-to-1 and Known-Regular One-way Functions.
IACR Cryptol. ePrint Arch., 2014

The Randomized Iterate Revisited - Almost Linear Seed Length PRGs from A Broader Class of One-way Functions.
Electron. Colloquium Comput. Complex., 2014

POSTER: Using Chinese Characters for Authentication-Algorithmic Framework and Empirical Results.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

POSTER: Arranging the Layout of Alphanumeric Buttons-the Role of Passwords.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Fully secure identity-based signcryption scheme with shorter signcryptext in the standard model.
Math. Comput. Model., 2013

On the Need of Physical Security for Small Embedded Devices: a Case Study with COMP128-1 Implementations in SIM Cards.
IACR Cryptol. ePrint Arch., 2013

Pseudorandom Generators from Regular One-way Functions: New Constructions with Improved Parameters.
IACR Cryptol. ePrint Arch., 2013

Leakage-Resilient Symmetric Cryptography Under Empirically Verifiable Assumptions.
IACR Cryptol. ePrint Arch., 2013

Overcoming Weak Expectations.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Direct Construction of Signcryption Tag-KEM from Standard Assumptions in the Standard Model.
Proceedings of the Information and Communications Security - 15th International Conference, 2013

Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

Constructing Practical Signcryption KEM from Standard Assumptions without Random Oracles.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Two-source extractors for leaky sources.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
Leftover Hash Lemma, Revisited.
IACR Cryptol. ePrint Arch., 2011

2010
Leakage Resilient Cryptography in Practice.
Proceedings of the Towards Hardware-Intrinsic Security - Foundations and Practice, 2010

Practical leakage-resilient pseudorandom generators.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Leakage Resilient Cryptography in Practice.
IACR Cryptol. ePrint Arch., 2009


  Loading...