A Lightweight Verifiable Secret Sharing in Internet of Things
نویسندگان
چکیده
Verifiable Secret Sharing (VSS) is a fundamental tool of cryptography and distributed computing in Internet Things. Since network bandwidth scarce resource, minimizing the number verification data will improve performance VSS. Existing VSS schemes, however, face limitations meeting energy consumptions for low-end devices, which make their adoption challenging resource-limited IoTs. To address above limitations, we propose scheme according to Nyberg’s one-way Accumulator Hash Functions (NAHFs). The proposed has two distinguished features: first, security based on NAHFs whose computational requirements are basic criteria known IoT devices and, second, upon receiving only one veri-fication data, participants can verify correctness both shares secret without any communication. Experimental results show that, compared Feldman Rajabi-Eslami scheme, consumption participant respectively reduced by at least 24% 83% secret.
منابع مشابه
An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things
Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...
متن کاملComputational Verifiable Secret Sharing Revisited
Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that allows a dealer to share a secret among n parties in the presence of an adversary controlling at most t of them. In the computational setting, the feasibility of VSS schemes based on commitments was established over two decades ago. Interestingly, all known computational VSS schemes rely on the homomorphi...
متن کاملA practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2022
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2022.01305115