Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Secure Multi-party Computation in Black-Box Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation Processes: Lower Bounds for the Critical Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Multiparty Computation with Linear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank

Latest revision as of 01:59, 29 June 2024

scientific article
Language Label Description Also known as
English
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
scientific article

    Statements

    Graph Design for Secure Multiparty Computation over Non-Abelian Groups (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    0 references
    multiparty computation
    0 references
    passive adversary
    0 references
    non-abelian groups
    0 references
    graph coloring
    0 references
    percolation theory
    0 references
    0 references