Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Network-Hiding Communication and Applications to Multi-party Protocols

Martin Hirt, Ueli M. Maurer, Daniel Tschudi, Vassilis Zikas

Published Jan 1, 2016• 17 citations
Publisher
DOI
10.1007/978-3-662-53008-5_12

Related papers

Topology-Hiding Broadcast Based on NTRUEncrypt

Bo Mi, Dongyan Liu

Secure multi-party computation (MPC) has been a research focus of cryptography in resent studies.However, hiding the topology of the network in secure computation is a rather novel goal.Inspired by a seminal paper [1], we proposed a topology-hiding broadcast protocol based on NTRUEncrypt and secret sharing.The topology is concealed as long as any part of the network is corrupted.And we also illustrated the merits of our protocol by performance and security analysis.

KSII Transactions on Internet and Information Systems•Jan 31, 2016•2 citations

Efficient Secure Two-Party Protocols: Techniques and Constructions

Carmit Hazay, Yehuda Lindell

Information security and cryptography•Jan 1, 2010•348 citations

Privacy for multi-party protocols

Takashi Satoh, Kaoru Kurosawa, Shigeo Tsujii

Lecture notes in computer science•Jan 1, 1993•1 citation

Cryptographic Protocols with Strong Security: Non-Malleable Commitments, Concurrent Zero-Knowledge and Topology-Hiding Multi-Party Computation

Silas Richelson

The idea of protocol security is fundamental in cryptography, and the cryptographic literature is full of different notions of security and different models in which these notions can be achieved. This thesis contains three distinct lines of work, connected by the commonality that the security that they achieve is relevant in today's world of highly interconnected and parallelized networking. Wemake advancements to the well-studied non-malleable and concurrent security models, and in addition we formulate a new security notion of our own called ``topology hiding security.'' Specifically, we give a new protocol for non-malleable commitment, a new model for constant roundconcurrent zero knowledge, and a new multi-party computation protocol which achieves topology hiding security for a large family of underlying network graphs.

•Jan 1, 2014•3 citations

Adaptive Security of Multi-party Protocols, Revisited

Martin Hirt, Chen-Da Liu-Zhang, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 2021•4 citations

Unconditional Secure Topology-hiding Broadcast Via Shamir’s Secret Sharing

Bo Mi, Bingqing Wu, Fengtian Kuang +3 more

Secure Multi-Party Computation is a hot topic in recent years. However, though Secure Multi-Party Computation allows each participant to calculate without making their information known to other nodes, the underlying topology of their network is prone to exposure. Inspired by Tal Moran, Bo Mi et al. designed a broadcast protocol based on NTRUEcrypt, which realized topology-hiding but relying on a third party. In view of this shortcoming, we proposed a topology-hiding broadcast protocol based on Shamir's Secret Sharing scheme with self-adaptive paradigm. Security and performance analyses demonstrated that our scheme is unconditional secure and computationally light-weighted.

IEEE Data Driven Control and Learning Systems Conference (DDCLS)•Nov 20, 2020•0 citations
The idea of protocol security is fundamental in cryptography, and the cryptographic literature is full of different notions of security and different models in which these notions can be achieved. This thesis contains three distinct lines of work, connected by the commonality that the security that they achieve is relevant in today's world of highly interconnected and parallelized networking. Wemake advancements to the well-studied non-malleable and concurrent security models, and in addition we formulate a new security notion of our own called ``topology hiding security.'' Specifically, we give a new protocol for non-malleable commitment, a new model for constant roundconcurrent zero knowledge, and a new multi-party computation protocol which achieves topology hiding security for a large family of underlying network graphs.
Secure Multi-Party Computation is a hot topic in recent years. However, though Secure Multi-Party Computation allows each participant to calculate without making their information known to other nodes, the underlying topology of their network is prone to exposure. Inspired by Tal Moran, Bo Mi et al. designed a broadcast protocol based on NTRUEcrypt, which realized topology-hiding but relying on a third party. In view of this shortcoming, we proposed a topology-hiding broadcast protocol based on Shamir's Secret Sharing scheme with self-adaptive paradigm. Security and performance analyses demonstrated that our scheme is unconditional secure and computationally light-weighted.