On \(d\)-multiplicative secret sharing (Q604627): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computationally private randomizing polynomials and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Simultaneous Messages / 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: Q5302091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249652 / 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: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation from Random Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-One Law for Boolean Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / 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: Player simulation and general adversary structures in perfect multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party computation made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes / rank
 
Normal rank

Revision as of 10:48, 3 July 2024

scientific article
Language Label Description Also known as
English
On \(d\)-multiplicative secret sharing
scientific article

    Statements

    On \(d\)-multiplicative secret sharing (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2010
    0 references
    secret sharing
    0 references
    secure multiparty computation
    0 references
    secure multiplication
    0 references

    Identifiers