找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Cryptology and Network Security; 8th International Co Juan A. Garay,Atsuko Miyaji,Akira Otsuka Conference proceedings 2009 Springer-Verlag

[复制链接]
楼主: ACID
发表于 2025-3-28 18:14:00 | 显示全部楼层
Conference proceedings 2009he papers are organized in topical sections on cryptographic protocols and schemes; cryptanalysis; wireless and sensor security; network security; privacy and anonymity; functional and searchable encryption; authentication; block cipher design; and algebraic and number-theoretic schemes.
发表于 2025-3-28 19:04:21 | 显示全部楼层
发表于 2025-3-28 23:35:44 | 显示全部楼层
The rocket-plane and the Space Shuttle,ce-based compression methods cannot be adapted to accommodate our extended setting when the underlying systems require more than a mere exponentiation. As an application, we present an improved, torus-based implementation of the ACJT group signature scheme.
发表于 2025-3-29 05:22:33 | 显示全部楼层
发表于 2025-3-29 09:10:43 | 显示全部楼层
发表于 2025-3-29 11:27:29 | 显示全部楼层
发表于 2025-3-29 19:23:34 | 显示全部楼层
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with ns for Distributed Private Matching and Cardinality of Set Intersection were . secure and the previous Set Disjointness solution, though information theoretically secure, is in a two party setting. We also propose a new model for Distributed Private matching which is relevant in a multi-party setting.
发表于 2025-3-29 21:11:43 | 显示全部楼层
发表于 2025-3-30 03:16:57 | 显示全部楼层
Extensions of the Cube Attack Based on Low Degree Annihilatorscomplexity can be improved. When the size of the filter function is smaller than the LFSR, we can improve the attack complexity further by considering a sliding window version of the cube attack with annihilators. Finally, we extend the cube attack to vectorial Boolean functions by finding implicit relations with low-degree polynomials.
发表于 2025-3-30 07:18:44 | 显示全部楼层
Privacy-Preserving Relationship Path Discovery in Social Networksthe core functionalities of social networks: discovery of paths between individuals. Our algorithm preserves the privacy of relationship information, and can operate offline during the path discovery phase. We simulate our algorithm on real social network topologies.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 12:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表