Yi Deng

Orcid: 0000-0001-5948-0780

Affiliations:
  • Chinese Academy of sciences, Institute of Software, State Key Laboratory of Information Security, Beijing, China


According to our database1, Yi Deng authored at least 39 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast and Designated-verifier Friendly zkSNARKs in the BPK Model.
IACR Cryptol. ePrint Arch., 2023

Zero-Knowledge Elementary Databases with Function Queries.
IACR Cryptol. ePrint Arch., 2023

Fast Blind Rotation for Bootstrapping FHEs.
IACR Cryptol. ePrint Arch., 2023

Zero-Knowledge Functional Elementary Databases.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Non-Malleable Functions and their Applications.
J. Cryptol., 2022

Promise Σ-protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups.
IACR Cryptol. ePrint Arch., 2022

Knowledge Encryption and Its Applications to Simulatable Protocols With Low Round-Complexity.
IACR Cryptol. ePrint Arch., 2022

2021
Promise $\varSigma $-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Individual Simulations.
IACR Cryptol. ePrint Arch., 2020

A Practical NIZK Argument for Confidential Transactions over Account-Model Blockchain.
Proceedings of the Provable and Practical Security - 14th International Conference, ProvSec 2020, Singapore, November 29, 2020

Public Verifiable Private Decision Tree Prediction.
Proceedings of the Information Security and Cryptology - 16th International Conference, 2020

2019
KDM security for identity-based encryption: Constructions and separations.
Inf. Sci., 2019

Non-malleable Zero-Knowledge Arguments with Lower Round Complexity.
IACR Cryptol. ePrint Arch., 2019

(Identity-based) dual receiver encryption from lattice-based programmable hash functions with high min-entropy.
Cybersecur., 2019

A novel approach to public-coin concurrent zero-knowledge and applications on resettable security.
Sci. China Inf. Sci., 2019

2018
Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds.
Cybersecur., 2018

On the Security of Classic Protocols for Unique Witness Relations.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017
An Efficient NIZK Scheme for Privacy-Preserving Transactions over Account-Model Blockchain.
IACR Cryptol. ePrint Arch., 2017

On Instance Compression, Schnorr/Guillou-Quisquater, and the Security of Classic Protocols for Unique Witness Relations.
IACR Cryptol. ePrint Arch., 2017

Magic Adversaries Versus Individual Reduction: Science Wins Either Way.
Electron. Colloquium Comput. Complex., 2017

From Attack on Feige-Shamir to Construction of Oblivious Transfer.
Proceedings of the Information Security and Cryptology - 13th International Conference, 2017

2016
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

2015
Improving Accuracy of Static Integer Overflow Detection in Binary.
Proceedings of the Research in Attacks, Intrusions, and Defenses, 2015

2014
Evaluating and comparing the quality of access control in different operating systems.
Comput. Secur., 2014

Systematic Analysis and Detection of Misconfiguration Vulnerabilities in Android Smartphones.
Proceedings of the 13th IEEE International Conference on Trust, 2014

2013
Static Integer Overflow Vulnerability Detection in Windows Binary.
Proceedings of the Advances in Information and Computer Security, 2013

Heuristic Path Pruning Algorithm Based on Error Handling Pattern Recognition in Detecting Vulnerability.
Proceedings of the IEEE 37th Annual Computer Software and Applications Conference, 2013

Refining the Pointer Analysis by Exploiting Constraints on the CFL-Paths.
Proceedings of the 20th Asia-Pacific Software Engineering Conference, 2013

2012
On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2012

2011
Resettable Cryptography in Constant Rounds - the Case of Zero Knowledge.
IACR Cryptol. ePrint Arch., 2011

2009
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.
Proceedings of the Computer Science, 2009

2008
Resettably-Sound Resettable Zero Knowledge Arguments for NP.
IACR Cryptol. ePrint Arch., 2008

Novel Omega-protocols for NP.
Sci. China Ser. F Inf. Sci., 2008

Strengthening QIM-Based Watermarking by Non-uniform Discrete Cosine Transform.
Proceedings of the Information Hiding, 10th International Workshop, 2008

2007
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability.
Proceedings of the Advances in Cryptology, 2007

Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption.
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007

2006
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption.
IACR Cryptol. ePrint Arch., 2006

Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model.
IACR Cryptol. ePrint Arch., 2006


  Loading...