High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3175787086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Output Secure Computation with Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Variant of Universally Composable Security for Standard Multiparty Computation / 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: Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of the “Free-XOR” Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Multiparty Computation: Theory and Implementation / 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 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: Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to MPC with Preprocessing Using OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: OT-Combiners via Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Robust Combiners for Oblivious Transfer and Other Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) / rank
 
Normal rank
Property / cites work
 
Property / cites work: TinyKeys: a new approach to efficient multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low cost constant round MPC combining BMR and oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / 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: Efficient Implementation of the Orlandi Protocol / 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: The IPS Compiler: Optimizations, Variants and Concrete Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dishonest Majority Multi-Party Computation for Binary Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries / 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: LEGO for Two-Party Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation Is Practical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15--17, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings / rank
 
Normal rank

Latest revision as of 08:50, 26 July 2024

scientific article
Language Label Description Also known as
English
High-performance multi-party computation for binary circuits based on oblivious transfer
scientific article

    Statements

    High-performance multi-party computation for binary circuits based on oblivious transfer (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2021
    0 references
    multi-party computation
    0 references
    oblivious transfer
    0 references
    secret sharing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers