找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Information Theoretic Security; 8th International Co Anja Lehmann,Stefan Wolf Conference proceedings 2015 Springer International Publishing

[复制链接]
楼主: BREED
发表于 2025-3-26 21:51:40 | 显示全部楼层
发表于 2025-3-27 04:01:25 | 显示全部楼层
发表于 2025-3-27 05:59:18 | 显示全部楼层
Metric Pseudoentropy: Characterizations, Transformations and Applications, many cryptographic applications, like leakage-resilient cryptography, deterministic encryption or memory delegation. In this paper we develop a general method to characterize metric-type computational variants of entropy, in a way depending only on properties of a chosen class of test functions (ad
发表于 2025-3-27 12:02:58 | 显示全部楼层
Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications twhere the given problem is extremely hard. They find important applications in hardness amplification. In this paper we revisit the following two fundamental results:.Using only the standard min-max theorem and some basic facts about convex approximations in .. spaces, we provide alternative modular
发表于 2025-3-27 14:40:30 | 显示全部楼层
Gambling, Computational Information and Encryption Security,ided an affirmative answer, using a compression-based notion of computational information to give a characterization equivalent to the standard computational notion of semantic security. We give two other equivalent characterizations. The first uses a computational formulation of Kelly’s (1957) mode
发表于 2025-3-27 21:48:56 | 显示全部楼层
Query-Complexity Amplification for Random Oracles,ployed for example in password-based cryptographic schemes to impede brute-force attacks, and also in so-called proofs of work (used in protocols like Bitcoin) to show that a certain amount of computation was performed by a legitimate user. A natural approach to adjust the complexity of a hash funct
发表于 2025-3-28 01:25:46 | 显示全部楼层
The Chaining Lemma and Its Application,rce distribution .. with high min-entropy and a number (say, . in total) of arbitrary functions (..,...,..) which are applied in succession to that source to generate the chain ........... ... . Intuitively, the Chaining Lemma guarantees that, if the chain is not too long, then either (i) the entire
发表于 2025-3-28 03:07:28 | 显示全部楼层
发表于 2025-3-28 08:22:55 | 显示全部楼层
发表于 2025-3-28 10:53:32 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 13:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表