Multi-party computation with conversion of secret sharing (Q664384): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59484975, #quickstatements; #temporary_batch_1718142333334
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Arithmetic Computation with No Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explication of secret sharing schemes / rank
 
Normal rank

Latest revision as of 23:27, 4 July 2024

scientific article
Language Label Description Also known as
English
Multi-party computation with conversion of secret sharing
scientific article

    Statements

    Multi-party computation with conversion of secret sharing (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-party computation
    0 references
    hybrid secret sharing schemes
    0 references
    unconditional security
    0 references
    0 references
    0 references