Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Perfect secure computation in two rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree 2 is complete for the round-complexity of malicious MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-key fully-homomorphic encryption in the plain model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE / 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: Efficient pseudorandom correlation generators from ring-LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Homomorphic Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reusable two-round MPC from DDH / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round adaptively secure multiparty computation from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reusable non-interactive secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-identity and Multi-key Leveled FHE from Learning with Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round MPC: information-theoretic and black-box / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with Minimal Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the round complexity of black-box secure MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic 2-round MPC without round collapsing: adaptive security, and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Round Multiparty Computation via Multi-key FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation with Minimal Interaction, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-key FHE from LWE, Revisited / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:54, 1 August 2024

scientific article; zbMATH DE number 7694624
Language Label Description Also known as
English
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
scientific article; zbMATH DE number 7694624

    Statements

    Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (English)
    0 references
    0 references
    0 references
    12 June 2023
    0 references
    dishonest majority
    0 references
    malicious security
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers