Adaptively secure MPC with sublinear communication complexity (Q5925696): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4938616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Shorter Bases for Hard Random Lattices / 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: From FE combiners to secure MPC and back / 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: Secure MPC: laziness leads to GOD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / 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: Succinct Randomized Encodings and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold cryptosystems from threshold fully homomorphic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH / 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: Must the communication graph of MPC protocols be an expander? / 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: Q4228521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus non-adaptive security of multi-party protocols / 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: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Two-Round Adaptive Multi-party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivocating Yao / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laconic oblivious transfer and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Secure Multiparty Computation in Constant Time / 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: On Adaptively Secure Multiparty Computation with a Short CRS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments / 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: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient adaptively secure zero-knowledge from garbled circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of low communication in secure multi-party computation / 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: Adaptively Secure Multi-Party Computation with Dishonest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveled Fully Homomorphic Signatures from Standard Lattices / 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: Short Pairing-Based Non-interactive Zero-Knowledge Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient one-sided adaptively secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Computation with Partial Erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-committing Encryption from Φ-hiding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Security with Quasi-Optimal Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Broadcast / 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: Public-Coin Differing-Inputs Obfuscation and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Synchronous Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Two-Party Computation with Erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive zero-knowledge proofs and adaptively secure oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / 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: Q4409113 / 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: Bi-Deniable Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact round complexity of secure three-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptively Secure Protocols / rank
 
Normal rank

Latest revision as of 21:26, 31 July 2024

scientific article; zbMATH DE number 7674051
Language Label Description Also known as
English
Adaptively secure MPC with sublinear communication complexity
scientific article; zbMATH DE number 7674051

    Statements

    Adaptively secure MPC with sublinear communication complexity (English)
    0 references
    0 references
    0 references
    0 references
    13 April 2023
    0 references
    secure multiparty computation
    0 references
    adaptive security
    0 references
    sublinear communication
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers