Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-014-9952-6 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-014-9952-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975861567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly Verifiable Secret Sharing for Cloud-Based Key Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical and provably secure scheme for publicly verifiable secret sharing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of verifiable secret sharing and secure multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Verifiability from Pairings in Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold cryptography based on Asmuth-Bloom secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Round Complexity of Verifiable Secret Sharing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly Verifiable Secret Sharing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-014-9952-6 / rank
 
Normal rank

Latest revision as of 16:26, 9 December 2024

scientific article
Language Label Description Also known as
English
Paillier-based publicly verifiable (non-interactive) secret sharing
scientific article

    Statements

    Paillier-based publicly verifiable (non-interactive) secret sharing (English)
    0 references
    18 August 2014
    0 references
    secret sharing
    0 references
    non-interactive PVSS
    0 references
    Paillier's encryption scheme
    0 references
    decisional composite residuosity assumption
    0 references

    Identifiers