Sublinear-communication secure multiparty computation does not require FHE (Q6061356): 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: An algebraic framework for silent preprocessing with trustless setup and active security / 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 Computation of Constant-Depth Circuits with Applications to Database Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Pseudorandom Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear secure computation from new assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Secret Sharing / 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: Foundations of Homomorphic Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Signatures and Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic secret sharing from lattices without FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch-OT with optimal rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scooby: improved multi-party homomorphic secret sharing based on FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the communication complexity of multiparty computation in the correlated randomness model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation with Low Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spooky Encryption and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic secret sharing from Paillier encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Point Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size and depth of layered Boolean circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An n logn Lower Bound on Synchronous Combinational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication preserving protocols for secure function evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rise of Paillier: homomorphic secret sharing and public-key silent OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / 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: Large message homomorphic secret sharing from DCR and applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:17, 21 August 2024

scientific article; zbMATH DE number 7773986
Language Label Description Also known as
English
Sublinear-communication secure multiparty computation does not require FHE
scientific article; zbMATH DE number 7773986

    Statements

    Sublinear-communication secure multiparty computation does not require FHE (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2023
    0 references
    secure multiparty computation
    0 references
    function secret sharing
    0 references
    private information retrieval
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references