A provably secure proxy signcryption scheme using bilinear pairings
From MaRDI portal
Publication:2336432
DOI10.1155/2014/454393zbMATH Open1442.94052DBLPjournals/jam/LoT14OpenAlexW2013526337WikidataQ59051457 ScholiaQ59051457MaRDI QIDQ2336432FDOQ2336432
Authors: Jia-Lun Tsai, Nai-wei Lo 
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/454393
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- New directions in cryptography
- Title not available (Why is that?)
- Hierarchical ID-Based Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient and Provably Secure Multi-receiver Identity-Based Signcryption
- Selected Areas in Cryptography
- ID-Based Blind Signature and Ring Signature from Pairings
- Efficient proxy signcryption scheme with provable CCA and CMA security
- Designing efficient proxy signature schemes for mobile communication
- Title not available (Why is that?)
- Cryptanalysis of efficient proxy signature schemes for mobile communication
Cited In (6)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- A new threshold proxy signature scheme from bilinear pairings
- Efficient proxy signcryption scheme with provable CCA and CMA security
- A secure anonymous proxy signcryption scheme
- Cryptology and Network Security
- Cryptology and Network Security
This page was built for publication: A provably secure proxy signcryption scheme using bilinear pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336432)
