標(biāo)題: Titlebook: Information Theoretic Security; 6th International Co Adam Smith Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2012 encrypti [打印本頁] 作者: Optician 時間: 2025-3-21 18:52
書目名稱Information Theoretic Security影響因子(影響力)
作者: Anguish 時間: 2025-3-21 22:31
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honestcial case of the computation of the . function over binary inputs in the secure channels model with a . broadcast channel. This simple function is a useful building block for other applications. The classical results in multiparty computation show that in this model, every function can be computed w作者: 拾落穗 時間: 2025-3-22 04:04 作者: 草率女 時間: 2025-3-22 07:57
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations, from a finite field. For error probability 2. the size of the proof is linear in . and only logarithmic in .. Therefore, for any fixed error probability, the amortized complexity vanishes as we increase .. In particular, when the committed values are from a field of small constant size, we improve 作者: 廢墟 時間: 2025-3-22 09:53 作者: 項(xiàng)目 時間: 2025-3-22 13:26
Shannon Impossibility, Revisited,d attackers must have a secret key as long as the message. This result motivated the introduction of modern encryption schemes, which are secure only against a computationally bounded attacker, and allow some small (negligible) advantage to such an attacker. It is a well known folklore that both suc作者: entice 時間: 2025-3-22 19:01
Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation,a designated sender party can specify an arbitrary affine function ., such that a designated receiver party learns .(.) for a single argument . of its choice. This primitive is of particular interest, since analogously to the construction of garbled boolean circuits based on OT one can construct gar作者: 心胸開闊 時間: 2025-3-22 23:24 作者: Nebulizer 時間: 2025-3-23 05:07 作者: MOTIF 時間: 2025-3-23 09:10 作者: STENT 時間: 2025-3-23 09:51
Optimum General Threshold Secret Sharing,(.,.)-TSS and (.,.,.)-threshold ramp secret sharing (TRSS). That is, for each of these two classes, an optimum construction which minimizes the share size was presented. The goal of this paper is to develop an optimum construction for a more general threshold class where the mutual information betwe作者: 險(xiǎn)代理人 時間: 2025-3-23 16:49 作者: ODIUM 時間: 2025-3-23 18:19 作者: GLOOM 時間: 2025-3-24 00:30
Information Theoretic Security978-3-642-32284-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 硬化 時間: 2025-3-24 04:20 作者: 感染 時間: 2025-3-24 09:45 作者: extract 時間: 2025-3-24 12:42 作者: 尾隨 時間: 2025-3-24 18:13 作者: 可卡 時間: 2025-3-24 21:59 作者: BUOY 時間: 2025-3-25 00:43
itional framework of homological algebra. The cyclic homology groups were computed in many examples and new important properties such as prod- uct structures, excision for H-unital ideals, or connections with cyclic objects and simplicial topology, were established. An excellent account of the state作者: etidronate 時間: 2025-3-25 06:43
Guessing Secrecy,does not change after seeing the ciphertext. Unlike perfect secrecy, guessing secrecy does allow some leakage of information but requires that the best guess of the plaintext remain the same after seeing the ciphertext. We define guessing secrecy and prove a number of results. We show that similar t作者: Vulvodynia 時間: 2025-3-25 08:40
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honestmultiparty computation of .(.., …,..)?=?..?+?…?+?.. for ..?∈?{0,1}, culminating in the most general tradeoff: ..?+?..?=?.?+?1 and ..?+?..?=?.?+?1. These tradeoffs are applicable as long as ..?
作者: Femine 時間: 2025-3-25 14:47 作者: Locale 時間: 2025-3-25 18:45
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations,circuit . over . with . inputs, in the following sense: given committed values .. and .., with .?=?1,…,. and .?=?1,…,., the prover shows that .(..,…,..)?=?.. for .?=?1,…,.. The interesting property is that the amortized complexity of verifying one circuit only depends on the multiplicative depth of 作者: 平 時間: 2025-3-25 23:07 作者: 細(xì)絲 時間: 2025-3-26 01:07 作者: Mindfulness 時間: 2025-3-26 04:55 作者: 合法 時間: 2025-3-26 09:38
Information-Theoretic Timed-Release Security: Key-Agreement, Encryption, and Authentication Codes,estigate a relationship of mechanisms between information-theoretic timed-release key-agreement and information-theoretic key-insulated key-agreement. It turns out that there exists a simple algorithm which converts the former into the latter, and vice versa. In the sense, we conclude that these two作者: 對手 時間: 2025-3-26 15:10 作者: 場所 時間: 2025-3-26 16:53 作者: indemnify 時間: 2025-3-26 23:19
Nico D?ttling,Daniel Kraschewski,J?rn Müller-Quade作者: covert 時間: 2025-3-27 04:06 作者: 合適 時間: 2025-3-27 07:21 作者: CLAY 時間: 2025-3-27 11:44
Shannon Impossibility, Revisited,o relaxations above is not sufficient.) Most proofs we saw either made some limiting assumptions (e.g., encryption is deterministic), or proved a much more complicated statement (e.g., beating Shannon’s bound implies the existence of one-way functions [IL89].)作者: 滔滔不絕的人 時間: 2025-3-27 13:58 作者: 值得 時間: 2025-3-27 18:54
Optimum General Threshold Secret Sharing,us one except for special functions such as convex and concave functions. The optimum construction encodes the secret by using one or more optimum TRSS schemes independently. The optimality is shown by devising a combination of TRSS schemes which achieves the new lower bound.作者: nautical 時間: 2025-3-27 22:09 作者: Hdl348 時間: 2025-3-28 04:40
Introductionthe long wave, comparable with the long wave downturn of the interwar period. Clearly, if one were to extrapolate that scheme in a very simplistic and mechanistic way, it would be tempting to conclude that a new revival of the world economy will occur between the late 1980s and the middle 1990s.作者: 禁止,切斷 時間: 2025-3-28 09:37 作者: Affluence 時間: 2025-3-28 12:50 作者: Eclampsia 時間: 2025-3-28 15:43 作者: 量被毀壞 時間: 2025-3-28 18:51 作者: 使熄滅 時間: 2025-3-29 00:26
U.S. Environmentalism since 1945ning applicants who have been granted consent to adopt. As these reports establish what is required for someone to be categorised as a suitable parent, they construct and display the moral order of parenthood. An analysis of statements about time, as it relates to parental leave, working hours, pres作者: Ingratiate 時間: 2025-3-29 05:49
Steiner Minimum Trees in Uniform Orientation Metrics,nts in ., such that the network has the shortest length possible with respect to a given distance function. Unlike minimum spanning trees, a Steiner minimum tree may contain vertices of degree 3 or more not in .. These points are usually referred to as Steiner points, and the inclusion of these poin作者: Vasodilation 時間: 2025-3-29 10:05
