-
10-24
2011
CTIC Cryptography Research Talk: Lower and Upper Bounds for Deniable Public-Key
演讲人： Peter Nordholt 奥胡斯大学 时间： 2011-10-24 15:30-2011-10-24 16:10 地点：FIT 1-222 内容： A deniable cryptosystem allows a sender and a receiver to communicate over an insecure channel in su...
-
10-24
2011
Data Aggregation in Communication Networks
演讲人： Pekka Orponen 芬兰阿尔托大学 时间： 2011-10-24 11:00-2011-10-24 12:00 地点：FIT 1-222 课件下载：点击下载 内容： In the problem of data aggregation in communication networks, messages arrivin...
-
10-21
2011
CTIC Cryptography Research Talk: Multiparty Computation from Somewhat Homomorphi
演讲人： Valerio Pastro 奥胡斯大学 时间： 2011-10-21 16:45-2011-10-21 17:30 地点：FIT 1-222 内容： We propose a general multiparty computation protocol secure against a dishonest majority, for comput...
-
10-21
2011
CTIC Cryptography Research Talk: Leakage-Resilient Cryptography From the Inner-P
演讲人： Sebastian Faust 奥胡斯大学 时间： 2011-10-21 16:00-2011-10-21 16:45 地点：FIT 1-222 内容： We present a generic method to secure various widely-used cryptosystems against arbitrary side-chan...
-
10-21
2011
CTIC Cryptography Research Talk: Superposition Attacks on Cryptographic Protocol
演讲人： Ivan Damgard 奥胡斯大学 时间： 2011-10-21 15:00-2011-10-21 16:00 地点：FIT 1-222 内容： Attacks on classical cryptographic protocols are usually modeled by allowing an adversary to ask queri...
-
10-20
2011
All-Pairs Shortest Paths in O(n2) Expected Time
演讲人： Uri Zwick 特拉维夫大学 时间： 2011-10-20 14:00-2011-10-20 15:00 地点：FIT 1-222 课件下载：点击下载 内容： We present an All-Pairs Shortest Paths (APSP) algorithm whose expected running time ...