找回密码
 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-26 22:49:06 | 显示全部楼层
Michael Hompel,Thorsten Schmidtmalization and apply it to the verification of a concrete anonymous credential system proposed by Camenisch and Lysyanskaya. The analysis is done automatically with the tool ProVerif and several security properties have been verified.
发表于 2025-3-27 04:55:10 | 显示全部楼层
发表于 2025-3-27 05:18:28 | 显示全部楼层
Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT. As a further contribution of this paper we computed linear hulls in practice for the original PRESENT cipher, which corroborated and even improved on the predicted bias (and the corresponding attack complexities) of conventional linear relations based on a single linear trail.
发表于 2025-3-27 11:58:09 | 显示全部楼层
发表于 2025-3-27 16:28:26 | 显示全部楼层
Verifying Anonymous Credential Systems in Applied Pi Calculusmalization and apply it to the verification of a concrete anonymous credential system proposed by Camenisch and Lysyanskaya. The analysis is done automatically with the tool ProVerif and several security properties have been verified.
发表于 2025-3-27 20:15:18 | 显示全部楼层
Asymptotically Optimal and Private Statistical Estimation via the traditional yardsticks of statistical inference. Specifically, we discuss two differentially private estimators that, given i.i.d. samples from a probability distribution, converge to the correct answer at the same rate as the optimal nonprivate estimator.
发表于 2025-3-28 01:35:50 | 显示全部楼层
Saturation Attack on the Block Cipher HIGHTin the 12-round saturation distinguishers given by the HIGHT proposers. And then two new 17-round saturation distinguishers are described. Finally, we present a 22-round saturation attack on HIGHT including full whitening keys with 2. chosen plaintexts and 2. 22-round encryptions.
发表于 2025-3-28 05:37:44 | 显示全部楼层
Transferable Constant-Size Fair E-Cashild an efficient (offline) e-cash system that guarantees user anonymity and transferability of coins without increasing their size. As required for fair e-cash, in case of fraud, anonymity can be revoked by an authority, which is also crucial to deter from double spending.
发表于 2025-3-28 10:09:51 | 显示全部楼层
Building Secure Networked Systems with Code Attestationpresent approaches on how to build secure systems with advanced TPM architectures. In particular, we have designed an approach for fine-grained attestation that enables the design of efficient secure distributed systems, and other network protocols.We demonstrate this approach by designing a secure routing protocol.
发表于 2025-3-28 14:18:58 | 显示全部楼层
HPAKE : Password Authentication Secure against Cross-Site User Impersonation channels, using a memorable and reusable single short password. Beside the usual PAKE security guarantees, our framework goes to lengths to secure the password against brute-force cracking from privileged server information.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 17:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表