نتایج جستجو برای: publicly verifiable secret sharing
تعداد نتایج: 130246 فیلتر نتایج به سال:
If phenomenal experience is a physical phenomenon, it must occur at some spatial and temporal location. Can consciousness be situated in such a strong sense? Although the importance of embodiment and situatedness is often mentioned, most neuroscientists and philosophers alike consider phenomenal experience as an outcome of neural activity. In this paper, the question I would raise is whether th...
A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t − 1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the secret. The other one is a (t, n)-thr...
We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to redistribute new shares secretly to the current participants. These capabilities are gained by storing additional aut...
Voting is an important tool for modern societies. It is fundamental for the democracy. This mechanism must be fair and accurate. However, threats intrinsic in the voting process may compromise these requisites. In conventional voting, dishonest talliers may corrupt the ballot box, for instance. Remote voting has more threats due to the uncontrolled environment. In this work, we propose secure p...
Wireless Sensor Networks (WSNs) support data collection and distributed data processing by means of very small sensing devices that are easy to tamper and clone: therefore classical security solutions based on access control and strong authentication are difficult to deploy. In this paper we look at the problem of assessing the reliability of node localization data from a game theoretical viewp...
Rational secret sharing is a fundamental primitive at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the players learns the dealer’s secret. Yet, all solutions so far were quite inefficient and relied on the players’ beliefs and not just on their rationality. After providing a m...
With the rapid development of MANET, secure and practical authentication is becoming increasingly important. The existing works perform the research from two aspects, i.e., (a)secure key division and distributed storage, (b)secure distributed authentication. But there still exist several unsolved problems. Specifically, it may suffer from cheating problems and fault authentication attack, which...
Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have many improvement schemes. Among all these schemes, verifiable multi-secret (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well participants. By pointing out that presented by Dehkordi Mashhadi 2008 cann...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید