Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation (Q2912810): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:12, 3 February 2024

scientific article
Language Label Description Also known as
English
Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
scientific article

    Statements

    Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation (English)
    0 references
    0 references
    0 references
    25 September 2012
    0 references
    secure arithmetic
    0 references
    two-party computation
    0 references
    probabilistically correct algorithm
    0 references
    data privacy
    0 references

    Identifiers

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