Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
CRYPTO '89 Proceedings on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
On the Exact Security of Full Domain Hash
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Identity-based confirmer signatures from pairings over elliptic curves
Proceedings of the 4th ACM conference on Electronic commerce
Efficient revocation and threshold pairing based cryptosystems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient ID-based blind signature and proxy signature from bilinear pairings
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Provably secure encrypt-then-sign composition in hybrid signcryption
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Efficient computations of the Tate pairing for the large MOV degrees
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
Information Security and Cryptology
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Identity based delegation network
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Identity based threshold ring signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
A generic construction of accountable decryption and its applications
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
Pairing-based cryptography is rapidly emerging in recent years. Many cryptographic protocols, such as signcryption, threshold decryption and undeniable signature enabled by pairing require sending the result of the pairing function with private key as one of the input. Since private key is only known to its owner, the correctness of the result may not be easily verifiable (which requires solving the decisional bilinear Diffie-Hellman problem). In this paper, we introduce the notion of Verifiable Pairing, together with a concrete construction, to ensure the robustness of these protocols. Verifiable pairing is a useful primitive in many information security applications. As examples, we show how verifiable pairing can be applied in signcryption, threshold decryption and how it can help in fixing insecure protocol. In adding verifiability to threshold decryption, our solution is more efficient than the previous proposal in [21]. As a bonus result, we find that our scheme for verifiable pairing gives rise to a new identity-based signature that is provably secure in the random oracle model without using the forking lemma, assuming the hardness of the computational bilinear Diffie-Hellman problem.