找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Information and Communication Security; 13th International C Sihan Qing,Willy Susilo,Dongmei Liu Conference proceedings 2011 Springer-Verla

[复制链接]
楼主: 口语
发表于 2025-3-25 04:41:12 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 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
发表于 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 | 显示全部楼层
发表于 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)
发表于 2025-3-26 10:28:01 | 显示全部楼层
发表于 2025-3-26 15:06:23 | 显示全部楼层
发表于 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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-17 19:17
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表