Round-efficient black-box construction of composable multi-party computation (Q1715857): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-018-9276-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791558958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple, Black-Box Constructions of Adaptively Secure Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A black-box construction of non-malleable encryption from semantically secure encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limitations of universally composable two-party computation without set-up assumptions / 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: Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmalleable Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrently Secure Computation in Constant Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant round non-malleable protocols using one way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-honest to Malicious Oblivious Transfer—The Black-Box Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Protocols for Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box constructions for 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: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Composable Protocols without Set-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Non-malleable Commitments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for UC from Only OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent zero knowledge, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250778 / rank
 
Normal rank

Revision as of 23:59, 17 July 2024

scientific article
Language Label Description Also known as
English
Round-efficient black-box construction of composable multi-party computation
scientific article

    Statements

    Round-efficient black-box construction of composable multi-party computation (English)
    0 references
    0 references
    29 January 2019
    0 references
    multi-party computation
    0 references
    composability
    0 references
    angel-based UC security
    0 references
    black-box construction
    0 references
    CCA-secure commitment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers