| Publication | Date of Publication | Type |
|---|
| Learning strongly deterministic even linear languages from positive examples | 2023-12-08 | Paper |
| Perfectly secure message transmission against rational timid adversaries | 2023-08-02 | Paper |
| Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation | 2023-06-30 | Paper |
| Arbitrable blind quantum computation | 2023-01-05 | Paper |
| Quantum verifiable protocol for secure modulo zero-sum randomness | 2022-12-06 | Paper |
| Guesswork of a Quantum Ensemble | 2022-07-13 | Paper |
| A guests managing system with lattice-based verifier-local revocation group signature scheme with time-bound keys | 2021-08-31 | Paper |
| Achieving full security for lattice-based group signatures with verifier-local revocation | 2021-01-18 | Paper |
| Perfectly Secure Message Transmission Against Independent Rational Adversaries | 2020-07-20 | Paper |
| New assumptions on isogenous pairing groups with applications to attribute-based encryption | 2019-03-29 | Paper |
| Private Conjunctive Query over Encrypted Data | 2017-08-04 | Paper |
| Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors | 2017-03-16 | Paper |
| Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption | 2015-10-20 | Paper |
| Practical Packing Method in Somewhat Homomorphic Encryption | 2015-10-01 | Paper |
| Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics | 2014-09-30 | Paper |
| On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption | 2014-09-17 | Paper |
| Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption | 2014-07-24 | Paper |
| Computational indistinguishability between quantum states and its cryptographic application | 2012-07-10 | Paper |
| Public Discussion Must Be Back and Forth in Secure Message Transmission | 2011-10-27 | Paper |
| Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function | 2010-03-09 | Paper |
| Reducing Complexity Assumptions for Oblivious Transfer | 2009-10-28 | Paper |
| Strengthening the Security of Distributed Oblivious Transfer | 2009-06-25 | Paper |
| Public Key Cryptography – PKC 2004 | 2009-05-14 | Paper |
| A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions | 2009-02-24 | Paper |
| Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification | 2009-01-09 | Paper |
| Computational Indistinguishability Between Quantum States and Its Cryptographic Application | 2008-05-06 | Paper |
| Low-density attack revisited | 2007-09-20 | Paper |
| Quantum computational cryptography | 2007-05-09 | Paper |
| Universal test for quantum one-way permutations | 2005-12-06 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046340 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043925 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474095 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452563 | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450741 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2724584 | 2002-07-28 | Paper |
| Strong encryption of public key cryptosystems based on weak randomness hypotheses | 2001-09-17 | Paper |
| Inferring pure context-free languages from positive data | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505375 | 2000-09-27 | Paper |
| Learning deterministic even linear languages from positive examples | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373609 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353917 | 1998-02-04 | Paper |
