Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perfect secure computation in two rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure multiparty computation with honest majority / 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: The resiliency of MPC with low interaction: the benefit of making errors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full proof of the BGW protocol for perfectly secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical ZAP arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure MPC: laziness leads to GOD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Verifiable Secret Sharing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir: from practice to theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle methodology, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zaps and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical secrecy and multibit commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on information exchange for Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of verifiable secret sharing and secure multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Zaps and new oblivious transfer protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in the multi-string model / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the round complexity of VSS in point-to-point networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimally fair coin toss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-term security and universal composability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero-knowledge arguments for NP using any one-way permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact round complexity of secure three-party computation / rank
 
Normal rank

Latest revision as of 15:06, 2 August 2024

scientific article; zbMATH DE number 7726491
Language Label Description Also known as
English
Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
scientific article; zbMATH DE number 7726491

    Statements

    Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    secure multiparty computation
    0 references
    sub-exponentially hard injective one-way functions
    0 references
    0 references
    0 references
    0 references