Generalized Learning Problems and Applications to Non-Commutative Cryptography 学术讲座
正在加载播放器...若长时间无响应,说明播放器不支持您当前使用的浏览器。请尝试更换其他浏览器观看。
相关推荐

暂无相关推荐

上传人:admin 上传时间:2017-10-23

视频描述: [主讲人: Prof. Antonio R. Nicolosi and Prof. Nelly Fazio ] [时间: 2011-10-20 13:30:00] 报告摘要:We propose a generalization of the learning parity with noise (LPN) and learning with errors (LWE) problems to an abstract class of group-theoretic learning problems that we term learning homomorphisms with noise (LHN). This class of problems contains LPN and LWE as special cases, but is much more general. It allows, for example, instantiations based on non-abelian groups, resulting in a new avenue for the application of combinatorial group theory to the development of cryptographic primitives. We then study a particular instantiation using relatively free groups and construct a symmetric cryptosystem based upon it. 主讲人简介:Dr. Nicolosi holds a Ph.D. (New York University '07) and a M.Sc. (New York University '04) in Computer Science, and is a member of the ACM, the IEEE, the IACR, the Internet Society, and the USENIX Association. Antonio R. Nicolosi is an Assistant Professor in the Computer Science Department at Stevens Institute of Technology since Fall'07. Before that, Dr. Nicolosi was a research scientist with the Stanford Secure Computer Systems group. Dr. Nicolosi's research interests are in cryptography and its applications to addressing issues of security and privacy in distributed systems. Much of his recent work is centered around Computer Systems Security, Applications of Cryptography to Distributed Systems, Elliptic-Curve Cryptography, Lattice-Based Cryptography, Lattices and Decoding Algorithms.