A robust \((k,n)+1\) threshold proxy signature scheme based on factoring (Q2485606): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2004.04.104 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007929723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multi-proxy multi-signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of shared RSA keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin / rank
 
Normal rank

Latest revision as of 14:48, 10 June 2024

scientific article
Language Label Description Also known as
English
A robust \((k,n)+1\) threshold proxy signature scheme based on factoring
scientific article

    Statements

    A robust \((k,n)+1\) threshold proxy signature scheme based on factoring (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2005
    0 references
    0 references
    Proxy signature
    0 references
    Threshold signature
    0 references
    Improved RSA scheme
    0 references
    Factoring
    0 references
    0 references