| Publication | Date of Publication | Type |
|---|
Model predictive complex system control from observational and interventional data
Chaos | 2025-01-14 | Paper |
| NEV: faster and smaller NTRU encryption using vector decoding | 2024-08-30 | Paper |
| Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes | 2024-08-30 | Paper |
Hardness of (M)LWE with semi-uniform seeds
Theoretical Computer Science | 2024-03-28 | Paper |
Fast blind rotation for bootstrapping FHEs
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Half-tree: halving the cost of tree expansion in COT and DPF
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
| A practical NIZK argument for confidential transactions over account-model blockchain | 2023-03-21 | Paper |
Attribute-based keyword search from lattices
Information Security and Cryptology | 2022-10-14 | Paper |
| Predicting the concrete security of LWE against the dual attack using binary search | 2022-06-08 | Paper |
| Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact | 2022-04-22 | Paper |
| Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN | 2022-04-22 | Paper |
Non-malleable functions and their applications
Journal of Cryptology | 2022-04-04 | Paper |
| Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes | 2021-12-01 | Paper |
An improved algorithm for learning sparse parities in the presence of noise
Theoretical Computer Science | 2021-06-22 | Paper |
KDM security for identity-based encryption: constructions and separations
Information Sciences | 2020-12-10 | Paper |
| Lattice-based cryptosystems. A design perspective | 2020-12-07 | Paper |
| Valiant's universal circuits revisited: an overall improvement and a lower bound | 2020-05-20 | Paper |
| Collision resistant hashing from sub-exponential learning parity with noise | 2020-05-05 | Paper |
| Secure outsourcing of cryptographic circuits | 2018-11-07 | Paper |
| Security of the SM2 signature scheme against generalized key substitution attacks | 2018-10-26 | Paper |
| Two-round PAKE from approximate SPH and instantiations from lattices | 2018-02-23 | Paper |
Cryptography with auxiliary input and trapdoor from constant-noise LPN
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Non-malleable functions and their applications
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Generic constructions of integrated PKE and PEKS
Designs, Codes and Cryptography | 2016-02-19 | Paper |
Authenticated key exchange from ideal lattices
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Proxy re-encryption with unforgeable re-encryption keys
Cryptology and Network Security | 2015-02-10 | Paper |
Black-box separations for one-more (static) CDH and its generalization
Lecture Notes in Computer Science | 2015-01-06 | Paper |
PRE: stronger security notions and efficient construction with non-interactive opening
Theoretical Computer Science | 2014-06-23 | Paper |
Towards a secure certificateless proxy re-encryption scheme
Provable Security | 2013-10-23 | Paper |
A generic construction from selective-IBE to public-key encryption with non-interactive opening
Information Security and Cryptology | 2013-01-07 | Paper |
A ciphertext policy attribute-based encryption scheme without pairings
Information Security and Cryptology | 2013-01-07 | Paper |
Dynamical Reversibility and A New Theory of Causal Emergence
(available as arXiv preprint) | N/A | Paper |
