Scalable Multi-domain Trust Infrastructures for Segmented Networks
- URL: http://arxiv.org/abs/2310.04898v2
- Date: Tue, 10 Oct 2023 06:21:37 GMT
- Title: Scalable Multi-domain Trust Infrastructures for Segmented Networks
- Authors: Sam Grierson, William J Buchanan, Craig Thomson, Baraq Ghaleb, Leandros Maglaras, Chris Eckl,
- Abstract summary: This paper outlines a method of creating a leaderless approach to defining trust domains.
It proposes the usage of the Edwards curve digital signature algorithm for the definition of multiple trust zones.
- Score: 1.388092651233226
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Within a trust infrastructure, a private key is often used to digitally sign a transaction, which can be verified with an associated public key. Using PKI (Public Key Infrastructure), a trusted entity can produce a digital signature, verifying the authenticity of the public key. However, what happens when external entities are not trusted to verify the public key or in cases where there is no Internet connection within an isolated or autonomously acting collection of devices? For this, a trusted entity can be elected to generate a key pair and then split the private key amongst trusted devices. Each node can then sign part of the transaction using their split of the shared secret. The aggregated signature can then define agreement on a consensus within the infrastructure. Unfortunately, this process has two significant problems. The first is when no trusted node can act as a dealer of the shares. The second is the difficulty of scaling the digital signature scheme. This paper outlines a method of creating a leaderless approach to defining trust domains to overcome weaknesses in the scaling of the elliptic curve digital signature algorithm. Instead, it proposes the usage of the Edwards curve digital signature algorithm for the definition of multiple trust zones. The paper shows that the computational overhead of the distributed key generation phase increases with the number of nodes in the trust domain but that the distributed signing has a relatively constant computational overhead.
Related papers
- A new approach to delegate signing rights to proxy signers using isogeny-based cryptography [0.0]
We propose the first post-quantum isogeny based proxy signature scheme CSI-PS (commutative supersingular isogeny proxy signature)
Our construction is proven to be uf-cma secure under the hardness of the group action inverse problem (IPGA) based on isogeny.
arXiv Detail & Related papers (2024-07-18T09:19:19Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Quantum resistant multi-signature scheme with optimal communication round: A Blockchain-based approach [0.0]
We present a new multi signature scheme based on lattices, known as Razhims, that has aggregate public key, necessitates solely a single round of communication, and is resistant to quantum computers.
In Razhims, the aggregate public key size and the final signature size are equal to validating the public key size and the final signature size of a standard signature respectively, and are independent of the number of signers.
arXiv Detail & Related papers (2024-04-27T06:05:44Z) - Revocable Quantum Digital Signatures [57.25067425963082]
We define and construct digital signatures with revocable signing keys from the LWE assumption.
In this primitive, the signing key is a quantum state which enables a user to sign many messages.
Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
arXiv Detail & Related papers (2023-12-21T04:10:07Z) - Enabling Data Confidentiality with Public Blockchains [6.092714083639697]
Multi-Authority Approach to Transaction Systems for Interoperating Applications (MARTSIA)
MARTSIA enables read-access control over shared data at the level of message parts.
Based on Multi-Authority Attribute-Based Encryption (MA-ABE), MARTSIA enables read-access control over shared data at the level of message parts.
arXiv Detail & Related papers (2023-08-04T13:21:48Z) - Samplable Anonymous Aggregation for Private Federated Data Analysis [25.35309084903802]
Locally differentially private algorithms require little trust but are (provably) limited in their utility.
Centrally differentially private algorithms can allow significantly better utility but require a trusted curator.
Our first contribution is to propose a new primitive that allows for efficient implementation of several commonly used algorithms.
arXiv Detail & Related papers (2023-07-27T17:19:37Z) - FedSOV: Federated Model Secure Ownership Verification with Unforgeable
Signature [60.99054146321459]
Federated learning allows multiple parties to collaborate in learning a global model without revealing private data.
We propose a cryptographic signature-based federated learning model ownership verification scheme named FedSOV.
arXiv Detail & Related papers (2023-05-10T12:10:02Z) - Establishing shared secret keys on quantum line networks: protocol and
security [0.0]
We show the security of multi-user key establishment on a single line of quantum communication.
We consider a quantum communication architecture where qubit generation and measurement happen at the two ends of the line.
arXiv Detail & Related papers (2023-04-04T15:35:23Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Collective Robustness Certificates: Exploiting Interdependence in Graph
Neural Networks [71.78900818931847]
In tasks like node classification, image segmentation, and named-entity recognition we have a classifier that simultaneously outputs multiple predictions.
Existing adversarial robustness certificates consider each prediction independently and are thus overly pessimistic for such tasks.
We propose the first collective robustness certificate which computes the number of predictions that are simultaneously guaranteed to remain stable under perturbation.
arXiv Detail & Related papers (2023-02-06T14:46:51Z) - How Much Can We Really Trust You? Towards Simple, Interpretable Trust
Quantification Metrics for Deep Neural Networks [94.65749466106664]
We conduct a thought experiment and explore two key questions about trust in relation to confidence.
We introduce a suite of metrics for assessing the overall trustworthiness of deep neural networks based on their behaviour when answering a set of questions.
The proposed metrics are by no means perfect, but the hope is to push the conversation towards better metrics.
arXiv Detail & Related papers (2020-09-12T17:37:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.