Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3133957339 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114850023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Utility Dependence in Correct and Fair Rational Secret Sharing / 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: Resilient-optimal interactive consistency in constant time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / 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: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally-Secure Robust Secret Sharing with Compact Shares / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Tightness of Parallel Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination and Composability of Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Secure Multiparty Computation Without Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively secure MPC with sublinear communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783743 / 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: Q4536817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient player-optimal protocols for strong and differential consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Rational Secret Sharing in Standard Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Secure MPC from Indistinguishability Obfuscation / 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: Fair Computation with Rational Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem for Any Interactive Argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational secret sharing and multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Broadcast / 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: Secure Multi-Party Computation with Identifiable Abort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Protocol Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Expected Constant-Round Protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Secure Computation in Point-to-Point Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Synchronous Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential composition of protocols without simultaneous termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Round Multiparty Computation via Multi-key FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness with an Honest Minority and a Rational Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Byzantine agreement for any number of faulty processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Must You Know the Code of f to Securely Compute f? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally Secure Signature Schemes Revisited / rank
 
Normal rank

Latest revision as of 01:36, 26 July 2024

scientific article
Language Label Description Also known as
English
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
scientific article

    Statements

    Round-preserving parallel composition of probabilistic-termination cryptographic protocols (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2021
    0 references
    multi-party computation protocols
    0 references
    round complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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