convulsion
发表于 2025-3-25 04:41:12
http://reply.papertrans.cn/47/4660/465907/465907_21.png
cathartic
发表于 2025-3-25 10:41:00
A Note on a Privacy-Preserving Distance-Bounding Protocolspoofing, as exploited by relay attacks. Recently, Rasmussen and Čapkun (ACM-CCS’08) observed that these protocols leak information on the location of the parties to external observers, which is undesirable in a number of applications—for example if the leaked information leads to the identification
逢迎白雪
发表于 2025-3-25 15:40:12
http://reply.papertrans.cn/47/4660/465907/465907_23.png
一窝小鸟
发表于 2025-3-25 15:50:38
Unconditionally Secure Oblivious Transfer Based on Channel Delays using a clear channel. Such impossibilities can be overcome by using a noisy channel. Recently, Palmieri and Pereira proposed a protocol based on random channel delays only. Their scheme is secure in the semi-honest model, but not in the general malicious model. In this paper we study oblivious tra
slow-wave-sleep
发表于 2025-3-25 21:21:50
Preserving Security and Privacy in Large-Scale VANETs. This type of networks is especially attractive in highly populated urban areas overwhelmed with traffic congestions and accidents. Besides vulnerabilities versus attacks against traffic safety and driver privacy, a large-scale VANET in a metropolitan area raises scalability and management challeng
无法治愈
发表于 2025-3-26 02:43:50
http://reply.papertrans.cn/47/4660/465907/465907_26.png
glans-penis
发表于 2025-3-26 06:14:19
Ideal Secret Sharing Schemes with Share Selectabilitynse) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. We also propose a quasi-selectable (i.e., a part of each user’s share is selectable)
MIME
发表于 2025-3-26 10:28:01
http://reply.papertrans.cn/47/4660/465907/465907_28.png
SPALL
发表于 2025-3-26 15:06:23
http://reply.papertrans.cn/47/4660/465907/465907_29.png
Interregnum
发表于 2025-3-26 20:31:22
Extension of Barreto-Voloch Root Extraction Methodd Voloch proposed an algorithm to compute .th roots in . for certain choices of . and .. If . || . − 1 and (., .) = 1, they proved that the complexity of their method is .. In this paper, we extend the Barreto-Voloch algorithm to the general case that . || .. − 1, without the restrictions . || . − 1