Abstract
Verifiably encrypted signature is a useful mechanism for fair exchange especially, for online contract signing. In this paper, we propose a verifiably encrypted signature scheme using bilinear pairings. The scheme is secure against existential forgery under chosen message attack and extraction, without random oracles.
Keywords: Fair Exchange, Verifiably Encrypted Signature, Bilinear Pairings, Random Oracles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gorantla, M.C., Saxena, A. (2005). Verifiably Encrypted Signature Scheme Without Random Oracles. In: Chakraborty, G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604655_41
Download citation
DOI: https://doi.org/10.1007/11604655_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30999-4
Online ISBN: 978-3-540-32429-4
eBook Packages: Computer ScienceComputer Science (R0)