The following pages link to Ran Cohen (Q775965):
Displayed 29 items.
- Must the communication graph of MPC protocols be an expander? (Q775967) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Topology-hiding communication from minimal assumptions (Q2119056) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q2119063) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- Asynchronous Secure Multiparty Computation in Constant Time (Q2798798) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation (Q2936624) (← links)
- Group Law Algorithms for Jacobian Varieties of Curves over Finite Fields (Q3545355) (← links)
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols (Q5111368) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Multiparty generation of an RSA modulus (Q5918574) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5919496) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Completeness theorems for adaptively secure broadcast (Q6186585) (← links)
- Breaking the O(√ n)-Bit Barrier (Q6201960) (← links)