| Publication | Date of Publication | Type |
|---|
Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler
Lecture Notes in Computer Science | 2023-08-21 | Paper |
| On the higher-bit version of approximate inhomogeneous short integer solution problem | 2022-06-29 | Paper |
Supersingular isogeny-based cryptography: a survey
Interdisciplinary Information Sciences | 2021-10-22 | Paper |
| How to implement a non-uniform or non-closed shuffle | 2021-07-06 | Paper |
On the classification of knowledge-of-exponent assumptions in cyclic groups
Interdisciplinary Information Sciences | 2020-11-23 | Paper |
On the fixed points of an elliptic-curve version of self-power map
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
A rigorous security proof for the enhanced version of password-protected secret sharing scheme
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
On the impossibility of proving security of strong-RSA signatures via the RSA assumption
Information Security and Privacy | 2014-07-24 | Paper |
\texttt{NP}-complete sets for computing discrete logarithms and integer factorization
Interdisciplinary Information Sciences | 2014-05-21 | Paper |
Toward separating the strong adaptive pseudo-freeness from the strong RSA assumption
Information Security and Privacy | 2013-06-28 | Paper |
Distributed construction of trust anchor with the hyper-powering signature scheme
Interdisciplinary Information Sciences | 2013-03-14 | Paper |
On the Complexity of Computing Discrete Logarithms over Algebraic Tori
Cryptology and Network Security | 2009-11-26 | Paper |
A Countermeasure for Protecting NTRUSign against the Transcript Attack
Interdisciplinary Information Sciences | 2008-07-11 | Paper |
| scientific article; zbMATH DE number 2080171 (Why is no real title available?) | 2004-08-04 | Paper |
Digital Money–A Survey
Interdisciplinary Information Sciences | 2004-01-27 | Paper |
Characterization of optimal key set protocols
Discrete Applied Mathematics | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1955803 (Why is no real title available?) | 2003-07-29 | Paper |
Provably Hard Zero-Way Functions
Interdisciplinary Information Sciences | 2002-12-10 | Paper |
| scientific article; zbMATH DE number 1759477 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1808257 (Why is no real title available?) | 2002-09-26 | Paper |
scientific article; zbMATH DE number 1925555 (Why is no real title available?)
International Journal of Information Security | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1676655 (Why is no real title available?) | 2001-11-25 | Paper |
| scientific article; zbMATH DE number 697828 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1304085 (Why is no real title available?) | 2000-03-07 | Paper |
| scientific article; zbMATH DE number 1406780 (Why is no real title available?) | 2000-03-01 | Paper |
Divertible and subliminal-free zero-knowledge proofs for languages
Journal of Cryptology | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1222849 (Why is no real title available?) | 1999-02-14 | Paper |
A structural comparison of the computational difficulty of breaking discrete log cryptosystems
Journal of Cryptology | 1999-01-03 | Paper |
| scientific article; zbMATH DE number 1186885 (Why is no real title available?) | 1998-01-01 | Paper |
A language-dependent cryptographic primitive
Journal of Cryptology | 1997-03-23 | Paper |
| scientific article; zbMATH DE number 503355 (Why is no real title available?) | 1994-11-29 | Paper |
On the Complexity of Hyperelliptic Discrete Logarithm Problem
Advances in Cryptology — EUROCRYPT ’91 | 1993-05-18 | Paper |
Demonstrating possession without revealing factors and its application
Advances in Cryptology — AUSCRYPT '90 | 1990-01-01 | Paper |
