| Publication | Date of Publication | Type |
|---|
Computing fixed argument pairings with the elliptic net algorithm
JSIAM Letters | 2019-03-18 | Paper |
A privacy-enhanced access log management mechanism in SSO systems from nominative signatures
International Journal of Applied Cryptography | 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
IEEE Transactions on Computers | 2017-08-08 | Paper |
Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
IEEE Transactions on Computers | 2017-07-27 | Paper |
Approach to Pairing Inversions Without Solving Miller Inversion
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Size-Hiding Computation for Multiple Parties
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Revocable decentralized multi-authority functional encryption
Progress in Cryptology – INDOCRYPT 2016 | 2016-12-21 | Paper |
Multi-party computation with small shuffle complexity using regular polygon cards
Provable Security | 2016-01-27 | Paper |
A short fail-stop signature scheme from factoring
Provable Security | 2015-09-29 | Paper |
Computer-aided decision-making with trust relations and trust domains (cryptographic applications)
Journal Of Logic And Computation | 2014-04-01 | Paper |
Constructing symmetric pairings over supersingular elliptic curves with embedding degree three
Pairing-Based Cryptography – Pairing 2013 | 2014-02-18 | Paper |
Cryptographic pairings based on elliptic nets
Advances in Information and Computer Security | 2011-11-10 | Paper |
New constructions of public-key encryption schemes from conjugacy search problems
Information Security and Cryptology | 2011-07-29 | Paper |
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
Lecture Notes in Computer Science | 2010-11-26 | Paper |
New identity-based proxy re-encryption schemes to prevent collusion attacks
Lecture Notes in Computer Science | 2010-11-26 | Paper |
Strongly unforgeable ID-based signatures without random oracles
International Journal of Applied Cryptography | 2010-09-22 | Paper |
FPGA and ASIC implementations of the \(\eta _T\) pairing in characteristic three
Computers and Electrical Engineering | 2010-04-07 | Paper |
A fast signature scheme based on new on-line computation
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Lecture Notes in Computer Science | 2009-11-10 | Paper |
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
Pairing-Based Cryptography – Pairing 2008 | 2009-02-10 | Paper |
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
Information Security and Cryptology | 2009-02-10 | Paper |
Efficient ID-Based Digital Signatures with Message Recovery
Cryptology and Network Security | 2008-04-15 | Paper |
Optimised Versions of the Ate and Twisted Ate Pairings
Cryptography and Coding | 2008-03-07 | Paper |
Verifier-Key-Flexible Universal Designated-Verifier Signatures
Cryptography and Coding | 2008-03-07 | Paper |
A Coprocessor for the Final Exponentiation of the η T Pairing in Characteristic Three
Arithmetic of Finite Fields | 2007-11-15 | Paper |
A Novel Range Test
Information Security and Privacy | 2007-09-07 | Paper |
| scientific article; zbMATH DE number 5180844 (Why is no real title available?) | 2007-08-20 | Paper |
Coding and Cryptography
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Information Security and Cryptology
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Cryptology and Network Security
Lecture Notes in Computer Science | 2006-11-14 | Paper |
| Cryptosystems based on elliptic curve pairing | 2006-06-22 | Paper |
| One-way and two-party authenticated ID-based key agreement protocols using pairing | 2006-06-22 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 2048538 (Why is no real title available?) | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1950332 (Why is no real title available?) | 2003-07-17 | Paper |
| scientific article; zbMATH DE number 1941234 (Why is no real title available?) | 2003-06-29 | Paper |
| scientific article; zbMATH DE number 1759337 (Why is no real title available?) | 2003-01-25 | Paper |
| scientific article; zbMATH DE number 1500497 (Why is no real title available?) | 2002-08-05 | Paper |
| scientific article; zbMATH DE number 1612524 (Why is no real title available?) | 2001-07-01 | Paper |
| scientific article; zbMATH DE number 1420971 (Why is no real title available?) | 2000-08-24 | Paper |
| scientific article; zbMATH DE number 1440075 (Why is no real title available?) | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1406794 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1222364 (Why is no real title available?) | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1189399 (Why is no real title available?) | 1999-03-02 | Paper |
| scientific article; zbMATH DE number 1107682 (Why is no real title available?) | 1998-04-03 | Paper |
| scientific article; zbMATH DE number 1304307 (Why is no real title available?) | 1998-01-01 | Paper |
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels
IEEE Transactions on Information Theory | 1997-10-28 | Paper |
| scientific article; zbMATH DE number 4070799 (Why is no real title available?) | 1988-01-01 | Paper |
