2005 | OriginalPaper | Chapter
Verifiably Encrypted Signature Scheme Without Random Oracles
Authors : M. Choudary Gorantla, Ashutosh Saxena
Published in: Distributed Computing and Internet Technology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.