NDN-MPS: supporting multiparty authentication over named data networking

  title={NDN-MPS: supporting multiparty authentication over named data networking},
  author={Zhiyi Zhang and Siqi Liu and Randy King and Lixia Zhang},
  journal={Proceedings of the 8th ACM Conference on Information-Centric Networking},
  • Zhiyi ZhangSiqi Liu Lixia Zhang
  • Published 8 June 2021
  • Computer Science
  • Proceedings of the 8th ACM Conference on Information-Centric Networking
Modern digitally controlled systems require multiparty authentication to meet the security requirements. This paper describes the design and development of NDN-MPS, an automated solution to support multiparty signing and verification for NDN-enabled applications. NDN-MPS proposes three basic changes to the existing NDN security solutions. First, it introduces a new type of trust schema that supports the semantics for multiparty singing and verification. Second, it extends the NDN signing… 

Figures from this paper

Investigating the Design Space for Name Confidentiality in Named Data Networking

The investigation suggests the feasibility of a systematic design that can enable NDN to provide stronger name confidentiality and user privacy as compared to today's TCP/IP Internet.

An Advanced Hierarchical Identity-Based Security Mechanism by Blockchain in Named Data Networking

  • Bing LiM. Ma
  • Computer Science
    Journal of Network and Systems Management
  • 2022
An advanced hierarchical identity-based security mechanism by blockchain (AHISM-B) is to be proposed for the NDN networks to avoid catastrophes due to a single node failure and both of the security proof result and the formal validation result indicate that the proposed AHISM- B is secure.



NDNCERT: universal usable trust management for NDN

The NDN Trust Management system (NDNCERT) is introduced which is designed to fill the need for simple, secure, and user-friendly management of cryptographic keys and certificates in the Named Data Networking architecture.

Schematizing Trust in Named Data Networking

The ability of NDN to enable automation through the use of trust schemas is explored, which can provide data consumers an automatic way to discover which keys to use to authenticate individual data packets, and provide data producers an automatic decision process to sign data packets.

An Overview of Security Support in Named Data Networking

NDN's approaches to security bootstrapping, data authenticity, confidentiality, and availability are introduced.

Aggregated path authentication for efficient BGP security

This paper proposes six constructions for aggregated path authentication that substantially improve efficiency of S-BGP's path authentication on both speed and space criteria and shows that the new schemes achieve such an efficiency that they may overcome the space obstacles and provide a real-world practical solution for BGP security.

Lessons Learned Building a Secure Network Measurement Framework using Basic NDN

The goals are both to present the network measurement framework and to motivate developers to evolve NDN by creating frameworks, libraries, and includible headers rather than bloating NDN's waist.

Fast Multiparty Threshold ECDSA with Fast Trustless Setup

This work is the first protocol that supports multiparty signatures for any $t łeq n$ with an efficient dealerless key generation and proves its scheme secure against malicious adversaries with a dishonest majority.

Simple Schnorr multi-signatures with applications to Bitcoin

To the best of the knowledge, this is the first multi-signature scheme provably secure under the Discrete Logarithm assumption in the plain public-key model which allows key aggregation.

Compact Multi-Signatures for Smaller Blockchains

The paper gives new constructions that are derived from Schnorr signatures and from BLS signatures that provide new functionality and are designed to reduce the size of the Bitcoin blockchain, but are useful in many other settings where multi-signatures are needed.

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

  • A. Boldyreva
  • Computer Science, Mathematics
    Public Key Cryptography
  • 2003
It turns out that most of the constructions are simpler, more efficient and have more useful properties than similar existing constructions.

Towards Scalable Threshold Cryptosystems

Techniques are presented that help scale threshold signature schemes, verifiable secret sharing and distributed key generation protocols to hundreds of thousands of participants and beyond and generalize to any Lagrange-based threshold scheme, not just threshold signatures.