Optician 发表于 2025-3-21 18:52:51

书目名称Information Theoretic Security影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0465744<br><br>        <br><br>书目名称Information Theoretic Security读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0465744<br><br>        <br><br>

Anguish 发表于 2025-3-21 22:31:49

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:24

http://reply.papertrans.cn/47/4658/465744/465744_3.png

草率女 发表于 2025-3-22 07:57:11

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:36

http://reply.papertrans.cn/47/4658/465744/465744_5.png

项目 发表于 2025-3-22 13:26:54

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:08

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:18

http://reply.papertrans.cn/47/4658/465744/465744_8.png

Nebulizer 发表于 2025-3-23 05:07:15

http://reply.papertrans.cn/47/4658/465744/465744_9.png

MOTIF 发表于 2025-3-23 09:10:24

http://reply.papertrans.cn/47/4658/465744/465744_10.png
页: [1] 2 3 4 5
查看完整版本: Titlebook: Information Theoretic Security; 6th International Co Adam Smith Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2012 encrypti