Titlebook: Information Theoretic Security; 6th International Co Adam Smith Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2012 encrypti

Optician

書(shū)目名稱Information Theoretic Security影響因子(影響力)




書(shū)目名稱Information Theoretic Security影響因子(影響力)學(xué)科排名




書(shū)目名稱Information Theoretic Security網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Information Theoretic Security網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Information Theoretic Security被引頻次




書(shū)目名稱Information Theoretic Security被引頻次學(xué)科排名




書(shū)目名稱Information Theoretic Security年度引用




書(shū)目名稱Information Theoretic Security年度引用學(xué)科排名




書(shū)目名稱Information Theoretic Security讀者反饋




書(shū)目名稱Information Theoretic Security讀者反饋學(xué)科排名

Anguish

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

拾落穗

草率女

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

廢墟

項(xiàng)目

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

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

心胸開(kāi)闊

Nebulizer

MOTIF