Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Benchmarking privacy preserving scientific operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing / 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: Secure computation with preprocessing via function secret sharing / 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: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Primitives for Secure Multiparty Integer Computation / 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: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited / 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: On the Power of Correlated Randomness in Secure Computation / 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: More general completeness theorems for secure two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Polynomial Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Binary Conversion for Paillier Encrypted Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values / rank
 
Normal rank

Latest revision as of 11:20, 27 July 2024

scientific article
Language Label Description Also known as
English
Function secret sharing for mixed-mode and fixed-point secure computation
scientific article

    Statements

    Function secret sharing for mixed-mode and fixed-point secure computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    0 references
    preprocessing model
    0 references
    mixed-mode secure computation
    0 references
    0 references
    0 references
    0 references