نتایج جستجو برای: identification scheme
تعداد نتایج: 625502 فیلتر نتایج به سال:
Project JXTA is an open-source effort to formulate and implement the core peer-to-peer (p2p) networking and collaboration protocols. A JXTA peer network is a complex overlay, constructed on top of the physical network, with its own identification scheme and routing. This paper reviews the performance of the JXTA networks using benchmarking, based on the proposed performance model. The two major...
The Fiat-Shamir transformation is a famous technique to turn identification schemes into signature schemes. The derived scheme is provably secure in the random-oracle model against classical adversaries. Still, the technique has also been suggested to be used in connection with quantum-immune identification schemes, in order to get quantum-immune signature schemes. However, a recent paper by Bo...
In this paper, we leverage bi-orthogonal signaling by using a time slot dependent identification scheme that enables energy efficient information dissemination, independent of the network topology. The approach, although motivated by cooperative modulation schemes that require information to be dispersed to other nodes within a wireless ad hoc network, can be applied directly to wired networks....
Blind signatures have proved an essential building block for applications that protect privacy while ensuring unforgeability, i.e., electronic cash and electronic voting. One of the oldest, and most efficient blind signature schemes is the one due to Schnorr that is based on his famous identification scheme. Although it was proposed over twenty years ago, its unforgeability remains an open prob...
In order to plan and deliver health care in a world with increasing number of older people, human motion monitoring is a must in their surveillance, since the related information is crucial for understanding their physical status. In this article, we focus on the physiological function and motor performance thus we present a light human motion identification scheme together with preliminary eva...
On the basis of analyzing the shortcomings of traditional authentication mechanism synthetically, the paper presents a new kind of P2P identity authentication model. In the new P2P Identity authentication model, it authenticates the identity of nodes by using a new Zero-Knowledge proof identification scheme which combines the advantage of RSA. Besides, during the process of validating nodes’ id...
We construct an interactive identification scheme based on the bilinear Diffie-Hellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identity-variance provided that an algorithm of computing the Weil-pairing is feasible. We prove that this scheme is secure against active attacks as well as passive attacks if the bi...
In light of the recent work of Micali and Reyzin on showing the subtleties and complexities of the soundness notions of zeroknowledge (ZK) protocols when the verifier has his public-key, we reinvestigate the Cramer-Damg̊ard intended-verifier identification scheme and show two man-in-the-middle attacks in some reasonable settings: one simple replaying attack and one ingenious interleaving attack....
The goal of cryptography is to construct secure and efficient protocols for various tasks. Unfortunately, it is often the case that protocols that are provably secure are not efficient enough for practical use. As a result, most protocols used in practice are heuristics that lack a proof of security. These heuristics are typically very efficient and are believed to be secure, though no proof of...
Mesoscale ocean eddies transport heat, salt, energy, and nutrients across oceans. As a result, accurately identifying and tracking such phenomena are crucial for understanding ocean dynamics and marine ecosystem sustainability. Traditionally, ocean eddies are monitored through two phases: identification and tracking. A major challenge for such an approach is that the tracking phase is dependent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید