MOTIF
发表于 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.
BOLT
发表于 2025-3-28 19:04:21
http://reply.papertrans.cn/25/2407/240603/240603_42.png
debase
发表于 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
http://reply.papertrans.cn/25/2407/240603/240603_44.png
男学院
发表于 2025-3-29 09:10:43
http://reply.papertrans.cn/25/2407/240603/240603_45.png
荨麻
发表于 2025-3-29 11:27:29
http://reply.papertrans.cn/25/2407/240603/240603_46.png
Badger
发表于 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.
FLACK
发表于 2025-3-29 21:11:43
http://reply.papertrans.cn/25/2407/240603/240603_48.png
不透明
发表于 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.