Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cryptosystems from \(2^k\)-th power residue symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434901 / 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: Yet another compiler for active security or: efficient MPC over arbitrary rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Cryptosystems from 2 k -th Power Residue Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overdrive: making SPDZ great again / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption / rank
 
Normal rank

Latest revision as of 08:47, 27 July 2024

scientific article
Language Label Description Also known as
English
Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references