Efficient identity-based threshold decryption scheme from bilinear pairings

DOI10.1007/s11704-016-5271-6zbMath1405.94063OpenAlexW2767823984MaRDI QIDQ1712600

Peng Zhang

Publication date: 22 January 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-016-5271-6

zbMATH Keywords

provable securityidentity-based cryptographyrandom oracle modelbilinear pairingthreshold cryptographyidentity-based threshold decryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• ID-based threshold decryption secure against adaptive chosen-ciphertext attack
• Implementing optimized pairings with elliptic nets
• Securing threshold cryptosystems against chosen ciphertext attack
• How to share a function securely
• Efficient revocation and threshold pairing based cryptosystems
• The Realm of the Pairings
• Exponentiating in Pairing Groups
• Identity-Based Cryptosystems and Signature Schemes
• How to share a secret
• Omega Pairing on Hyperelliptic Curves
• Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng
• Chosen-Ciphertext Secure Threshold Identity-Based Key Encapsulation Without Random Oracles
• Advances in Cryptology - EUROCRYPT 2004
• Topics in Cryptology – CT-RSA 2006
• Public Key Cryptography – PKC 2004

This page was built for publication: Efficient identity-based threshold decryption scheme from bilinear pairings