Probabilistic Termination and Composability of Cryptographic Protocols

DOI10.1007/978-3-662-53015-3_9zbMATH Open1406.94040OpenAlexW2482085991MaRDI QIDQ2829949FDOQ2829949

Authors: Ran Cohen, Sandro Coretti, Juan Garay, Vassilis Zikas 

Publication date: 9 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_9

Recommendations

• Probabilistic termination and composability of cryptographic protocols
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• Secure composition of cryptographic protocols. (Abstract)
• scientific article; zbMATH DE number 1759624
• scientific article; zbMATH DE number 697830
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1692932

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Security and composition of multiparty cryptographic protocols
• Multiparty Computation from Somewhat Homomorphic Encryption
• Founding Cryptography on Oblivious Transfer – Efficiently
• Authenticated Algorithms for Byzantine Agreement
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Multiparty computation with low communication, computation and interaction via threshold FHE
• A full proof of the BGW protocol for perfectly secure multiparty computation
• A lower bound for the time to assure interactive consistency
• Information-theoretically secure protocols and security under composition
• Universally composable two-party and multi-party secure computation
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Sequential composition of protocols without simultaneous termination
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Secure multi-party computation without agreement
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• On Expected Constant-Round Protocols for Byzantine Agreement
• The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
• On the composition of authenticated byzantine agreement
• Round-Efficient Secure Computation in Point-to-Point Networks
• A simpler variant of universally composable security for standard multiparty computation
• Universally composable synchronous computation
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Two round multiparty computation via multi-key FHE
• Two-round secure MPC from indistinguishability obfuscation
• Efficient three-party computation from cut-and-choose
• Efficient constant round multi-party computation combining BMR and SPDZ
• Title not available (Why is that?)
• Probabilistic Termination and Composability of Cryptographic Protocols
• Adaptively secure broadcast
• Adaptive versus Static Security in the UC Model
• Theory of Cryptography

Cited In (14)

• Probabilistic termination and composability of cryptographic protocols
• On the round complexity of randomized Byzantine agreement
• CryptHOL: game-based proofs in higher-order logic
• Completeness theorems for adaptively secure broadcast
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Proof-of-reputation blockchain with Nakamoto fallback
• Optimal extension protocols for Byzantine broadcast and agreement
• Sublinear-round Byzantine agreement under corrupt majority
• Topology-hiding computation for networks with unknown delays
• Proof-of-work-based consensus in expected-constant time
• Probabilistic Termination and Composability of Cryptographic Protocols
• Round-optimal Byzantine agreement
• Communication complexity of Byzantine agreement, revisited

This page was built for publication: Probabilistic Termination and Composability of Cryptographic Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829949)