Provably secure proxy-protected signature schemes based on factoring (Q1774844): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1763260
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2004.04.032 / rank
Normal rank
 
Property / author
 
Property / author: Zhen Fu Cao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2004.04.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989906504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2004.04.032 / rank
 
Normal rank

Latest revision as of 10:30, 11 December 2024

scientific article
Language Label Description Also known as
English
Provably secure proxy-protected signature schemes based on factoring
scientific article

    Statements

    Provably secure proxy-protected signature schemes based on factoring (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2005
    0 references
    In the paper two provably secure proxy-protected signature schemes in Random Oracle Model are presented. The first one is based on RSA ideas. The second proposed scheme is based on ideas of Rabin signature scheme. The authors prove that the proposed schemes are verifiable provided the original signer, the proxy signer and the verifier all follow the protocol. Then it is proved in the paper that the proposed schemes satisfy the unforgeability and the non-repudation. The schemes reduce the computation amount and are easy to implement.
    0 references
    RSA
    0 references
    factoring
    0 references
    proxy signature
    0 references
    proxy protected signature
    0 references
    random oracle model
    0 references
    0 references
    0 references
    0 references

    Identifiers