Ran Cohen

From MaRDI portal
Person:775965

Available identifiers

zbMath Open cohen.ranMaRDI QIDQ775965

List of research outcomes





PublicationDate of PublicationType
Secure multiparty computation with identifiable abort via vindicating release2024-12-13Paper
Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited2024-08-15Paper
Locally verifiable distributed SNARGs2024-08-01Paper
Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW2024-06-25Paper
Breaking the O(√ n)-Bit Barrier2024-03-26Paper
Completeness theorems for adaptively secure broadcast2024-02-02Paper
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party2023-11-21Paper
Correction to: ``Topology-hiding communication from minimal assumptions2023-10-25Paper
On the power of an honest majority in three-party computation without broadcast2023-07-26Paper
Must the communication graph of MPC protocols be an expander?2023-07-05Paper
Adaptively secure MPC with sublinear communication complexity2023-04-13Paper
On the round complexity of randomized Byzantine agreement2023-02-03Paper
Multiparty generation of an RSA modulus2022-12-07Paper
Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols2022-08-30Paper
On the round complexity of randomized Byzantine agreement2022-04-04Paper
Multiparty generation of an RSA modulus2022-04-04Paper
Broadcast-optimal two-round MPC2022-03-23Paper
Topology-hiding communication from minimal assumptions2022-03-23Paper
On the power of an honest majority in three-party computation without broadcast2022-03-23Paper
From fairness to full security in multiparty computation2022-01-06Paper
Round-preserving parallel composition of probabilistic-termination cryptographic protocols2021-06-28Paper
Must the communication graph of MPC protocols be an expander?2020-06-30Paper
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols2020-05-27Paper
Is information-theoretic topology-hiding computation possible?2020-04-30Paper
Adaptively secure MPC with sublinear communication complexity2020-03-09Paper
Probabilistic termination and composability of cryptographic protocols2019-08-13Paper
From fairness to full security in multiparty computation2018-10-17Paper
Characterization of secure multiparty computation without broadcast2018-05-28Paper
Fairness versus guaranteed output delivery in secure multiparty computation2018-02-15Paper
Probabilistic Termination and Composability of Cryptographic Protocols2016-11-09Paper
On Adaptively Secure Multiparty Computation with a Short CRS2016-10-21Paper
Asynchronous Secure Multiparty Computation in Constant Time2016-04-13Paper
Characterization of Secure Multiparty Computation Without Broadcast2016-03-23Paper
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation2015-01-06Paper
Group Law Algorithms for Jacobian Varieties of Curves over Finite Fields2008-12-10Paper

Research outcomes over time

This page was built for person: Ran Cohen