| Publication | Date of Publication | Type |
|---|
| Computing fixed argument pairings with the elliptic net algorithm | 2019-03-18 | Paper |
| A privacy-enhanced access log management mechanism in SSO systems from nominative signatures | 2018-11-26 | Paper |
| Secure multi-party computation using polarizing cards | 2018-10-24 | Paper |
| Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three | 2017-08-08 | Paper |
| Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves | 2017-07-27 | Paper |
| Approach to Pairing Inversions Without Solving Miller Inversion | 2017-07-12 | Paper |
| Size-Hiding Computation for Multiple Parties | 2017-01-06 | Paper |
| Revocable Decentralized Multi-Authority Functional Encryption | 2016-12-21 | Paper |
| Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards | 2016-01-27 | Paper |
| A Short Fail-Stop Signature Scheme from Factoring | 2015-09-29 | Paper |
| Computer-aided decision-making with trust relations and trust domains (cryptographic applications) | 2014-04-01 | Paper |
| Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three | 2014-02-18 | Paper |
| Cryptographic Pairings Based on Elliptic Nets | 2011-11-10 | Paper |
| New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems | 2011-07-29 | Paper |
| High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves | 2010-11-26 | Paper |
| New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion Attacks | 2010-11-26 | Paper |
| Strongly unforgeable ID-based signatures without random oracles | 2010-09-22 | Paper |
| FPGA and ASIC implementations of the \(\eta _T\) pairing in characteristic three | 2010-04-07 | Paper |
| A Fast Signature Scheme Based on New On-line Computation | 2010-02-09 | Paper |
| Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers | 2009-11-10 | Paper |
| A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ | 2009-02-10 | Paper |
| ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message | 2009-02-10 | Paper |
| Efficient ID-Based Digital Signatures with Message Recovery | 2008-04-15 | Paper |
| Optimised Versions of the Ate and Twisted Ate Pairings | 2008-03-07 | Paper |
| Verifier-Key-Flexible Universal Designated-Verifier Signatures | 2008-03-07 | Paper |
| A Coprocessor for the Final Exponentiation of the η T Pairing in Characteristic Three | 2007-11-15 | Paper |
| A Novel Range Test | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755103 | 2007-08-20 | Paper |
| Coding and Cryptography | 2007-05-02 | Paper |
| Information Security and Cryptology | 2006-11-14 | Paper |
| Cryptology and Network Security | 2006-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5473458 | 2006-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5473471 | 2006-06-22 | Paper |
| Information Security and Cryptology - ICISC 2003 | 2005-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452574 | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412960 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408429 | 2003-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536276 | 2003-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501509 | 2002-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721164 | 2001-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945043 | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4950066 | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940710 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217884 | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839202 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373625 | 1998-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251035 | 1998-01-01 | Paper |
| A construction of codes with exponential error bounds on arbitrary discrete memoryless channels | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3803027 | 1988-01-01 | Paper |
