On the exact round complexity of secure three-party computation (Q5918099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VIFF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sharemind / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-021-09404-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3193920125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations / 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: Round-optimal secure multiparty computation with honest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two round information-theoretic MPC with malicious security / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to round-optimal secure multiparty computation / 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: Non-Interactive Secure Computation Based on Cut-and-Choose / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation Goes Live / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise zero knowledge and its applications to round optimal MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four round secure computation without setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure MPC: laziness leads to GOD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Verifiable Secret Sharing Revisited / 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: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round optimal secure multiparty computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Secure Multiparty Computation Without Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Three-Party Computation from Cut-and-Choose / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable and Unconditionally Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost / 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: Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge / 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: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protecting data privacy in private information retrieval schemes / 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: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437112 / 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: The Exact Round Complexity of Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / 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: Round-optimal secure multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortizing Garbled Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation on the Web: Computing without Simultaneous Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation with Minimal Interaction, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with Minimal Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Protocol Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Garbling Schemes and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Security of Yao’s Garbled Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Garbled Circuit: Free XOR Gates and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient lookup-table protocol in secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Simulate It – A Tutorial on the Simulation Proof Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Secure 2PC in the Offline/Online and Batch Settings / 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: Bit commitment using pseudorandomness / 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: Beyond honest majority: the round complexity of fair and robust multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Halves Make a Whole / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:54, 26 July 2024

scientific article; zbMATH DE number 7393900
Language Label Description Also known as
English
On the exact round complexity of secure three-party computation
scientific article; zbMATH DE number 7393900

    Statements

    On the exact round complexity of secure three-party computation (English)
    0 references
    0 references
    0 references
    10 September 2021
    0 references
    MPC
    0 references
    round complexity
    0 references
    3PC
    0 references
    fairness
    0 references
    guaranteed output delivery
    0 references
    selective abort
    0 references
    unanimous abort
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers