Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A full proof of the BGW protocol for perfectly secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785503 / 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: A Simpler Variant of Universally Composable Security for Standard Multiparty Computation / 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: Efficient Three-Party Computation from Cut-and-Choose / 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: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus Static Security in the UC Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for 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: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party computation without agreement / 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: Adaptively Secure Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / 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: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Synchronous Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretically secure protocols and security under composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the composition of authenticated byzantine agreement / 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: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ / 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: Reaching Agreement in the Presence of Faults / rank
 
Normal rank

Latest revision as of 22:19, 12 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic Termination and Composability of Cryptographic Protocols
scientific article

    Statements

    Probabilistic Termination and Composability of Cryptographic Protocols (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references