Revocation games in ephemeral networks
Proceedings of the 15th ACM conference on Computer and communications security
Distributed Attribute-Based Encryption
Information Security and Cryptology --- ICISC 2008
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Automatic Generation of Memory Interfaces for ASIPs
International Journal of Embedded and Real-Time Communication Systems
| Hi-index | 0.00 |
Over the past few years a new tool from algebraic geometry, called a bilinear group, has transformed public-key cryptography. Bilinear groups enable the development of a new generation of cryptosystems that solve long standing open problems in cryptography and provide brand new functionality. In this short note we give a few examples and pose a number open problems that will hopefully be resolved in the coming years. This note is intended as a partial annotated bibliography and is far from a complete survey. For simplicity, throughout this note we use terms such as "efficient algorithm" and "negligible function." These terms can be made precise using asymptotic notation, equating "efficient" with "polynomial time" and "negligible function" with "eventually less than 1/nc for all c 0."