Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (Q5087258): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pseudorandom correlation generators: silent OT extension and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient 3-party distributed ORAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Point Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overdrive: making SPDZ great again / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Practical Active-Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic SIMD operations / rank
 
Normal rank

Latest revision as of 14:47, 29 July 2024

scientific article; zbMATH DE number 7554913
Language Label Description Also known as
English
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
scientific article; zbMATH DE number 7554913

    Statements

    Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (English)
    0 references
    0 references
    0 references
    8 July 2022
    0 references
    0 references
    distributed protocols
    0 references
    secure computation
    0 references
    communication complexity
    0 references
    0 references