Probabilistic Termination and Composability of Cryptographic Protocols
From MaRDI portal
Publication:2829949
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
Cites work
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A lower bound for the time to assure interactive consistency
- A simpler variant of universally composable security for standard multiparty computation
- Adaptive versus Static Security in the UC Model
- Adaptively secure broadcast
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Authenticated Algorithms for Byzantine Agreement
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Early stopping in Byzantine agreement
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient three-party computation from cut-and-choose
- Founding Cryptography on Oblivious Transfer – Efficiently
- Information-theoretically secure protocols and security under composition
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the composition of authenticated byzantine agreement
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Probabilistic Termination and Composability of Cryptographic Protocols
- Reaching Agreement in the Presence of Faults
- Round-Efficient Secure Computation in Point-to-Point Networks
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Sequential composition of protocols without simultaneous termination
- The Byzantine Generals Problem
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- Theory of Cryptography
- Two round multiparty computation via multi-key FHE
- Two-round secure MPC from indistinguishability obfuscation
- Universally composable synchronous computation
- Universally composable two-party and multi-party secure computation
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
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Completeness theorems for adaptively secure broadcast
- 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
- Round-optimal Byzantine agreement
- Probabilistic Termination and Composability of Cryptographic Protocols
- Proof-of-work-based consensus in expected-constant time
- 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)
