Titlebook: Security and Cryptography for Networks; 9th International Co Michel Abdalla,Roberto Prisco Conference proceedings 2014 Springer Internation

decoction

书目名称Security and Cryptography for Networks影响因子(影响力)




书目名称Security and Cryptography for Networks影响因子(影响力)学科排名




书目名称Security and Cryptography for Networks网络公开度




书目名称Security and Cryptography for Networks网络公开度学科排名




书目名称Security and Cryptography for Networks被引频次




书目名称Security and Cryptography for Networks被引频次学科排名




书目名称Security and Cryptography for Networks年度引用




书目名称Security and Cryptography for Networks年度引用学科排名




书目名称Security and Cryptography for Networks读者反馈




书目名称Security and Cryptography for Networks读者反馈学科排名

抑制

https://doi.org/10.1007/978-3-319-10879-7computer networks; cryptanalysis and other attacks; cryptography; encryption; information security; intru

摸索

控诉

Security and Cryptography for Networks978-3-319-10879-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

MEET

憎恶

搜集

Communication-Efficient MPC for General Adversary Structurestocols for general adversary structures. More specifically, ours is the first unconditionally secure protocol that achieves linear communication in the size of Monotone Span Program representing the adversary structure in the malicious setting against any . adversary structure, whereas all previous protocols were at least cubic.

租约

Reducing the Overhead of MPC over a Large Populatione depth, is ., for security parameter . and circuit size |.|. Our protocol finds application in cloud computing scenario, where the fraction of corrupted parties is relatively small. By minimizing the usage of point-to-point channels, our protocol can enable a cloud service provider to run multiple MPC protocols.

Debate

milligram

Obfuscation ⇒ (IND-CPA Security , Circular Security)ptions in bilinear groups..In this paper we finally settle the question showing that for every . there exists an IND-CPA secure scheme which is not .-circular secure..Our result relies on the recent progress in cryptographic obfuscation.