Keynote Speakers
|
| ||
|
|
Abstract: In this talk we will provide an overview of the Encrypted Analytics project at IBM IRL, i.e., preserving data privacy of users in hybrid/federated clouds, with our primary focus on preventing insider attacks on proprietary information. The goal of this project is to enable common data mining tasks on encrypted data, safeguarding customer data confidentiality at all times. In particular, we focus on data mining kernels like k-NN, k-Means and others and explore cryptographic techniques including different flavours of homomorphic encryption, as well as algorithmic innovations focusing on performance for typical workloads in the federated cloud model. The field of encrypted analytics requires a synergy across various disciplines including RDBMS, Data Mining, Security, Applied Crypto, and Approximation Algorithms. |
|
|
|
Bio: Prasad Naldurg is a Senior Researcher in the Knowledge Engineering and Encrypted Analytics group at IBM IRL Bangalore. He has a PhD in Computer Science from University of Illinois at Urbana-Champaign USA in May 2005, with a thesis on Dynamic access control models. He has over 11 years of experience in Security and Privacy research, including at Microsoft Research, and has contributed to the design and analysis of secure access control, IT policy management and configuration tools, anti-Malware, zero day attack detection, as well as DRM and software protection solutions. He has over 35 research papers in top security conferences including CCS, Usenix Security, and NDSS. He is a technical expert in access control, automated configuration analysis, applied cryptography, and secure systems design and auditing.
|
|
|
| ||
|
|
Abstract: Sleptsov place–transition nets (that allow transition firing in multiple instances at a step) run fast by implementing multiplication and division operations in polynomial time. In comparison, Petri nets implement the mentioned operations in exponential time. Moreover, Petri nets are obtained as a special case of Sleptsov nets using loops with places having unit marking attached to each transition. We offer a Sleptsov net based computational paradigm which consists in writing programs in high-level Sleptsov nets, compiling them into low-level (plain inhibitor) Sleptsov nets, and running them on hardware processors of Sleptsov nets. We develop basics of a Sleptsov net programming technology including basic operations and program composition rules. Also we develop prototypes of Sleptsov net processors in the form of universal Sleptsov nets; for their efficient massively parallel hardware implementation we offer a concept of computing memory. We provide examples of programs written in Sleptsov net language for encryption/decryption with the RSA algorithm, calculation of fuzzy logic functions, parallel calculation of the solutions to Laplace equations, and control of manufacturing systems. Sleptsov net computers promise hyper-performance because of fast implementation of basic operations and a concurrent programming style consisting in a concise graphical language and small granulation of parallel processes on the level of separate events. |
|
|
Bio: Dmitry A. Zaitsev, Senior Member of ACM and IEEE, received the Eng. degree in applied mathematics from Donetsk Polytechnic Institute, Donetsk, Ukraine, in 1986, the
Ph.D. degree in automated control from the Kiev Institute of Cybernetics, Kiev, Ukraine, in 1991, and the Dr.Sc. degree in telecommunications from the Odessa National Academy of Telecommunications, Odessa, Ukraine, in 2006. Since 2009, he has been with International Humanitarian University, Odessa, where he is currently a Professor of Computer Engineering. He developed the analysis of infinite Petri nets with regular structure, the decomposition of Petri nets in clans, and the method of synthesis of a fuzzy logic function given by table. His current research interests include Petri net theory and its application in networking, production control, and computing. More information at http://daze.ho.ua/
|
|