Теоретические проблемы программирования — различия между версиями
(→Расписание докладов) |
(→Расписание докладов) |
||
| Строка 27: | Строка 27: | ||
|- | |- | ||
| align = "center"| 03 октября | | align = "center"| 03 октября | ||
| − | | '''Computational privacy in public clouds. Beyond the impossibility | + | | '''Computational privacy in public clouds. Beyond the impossibility result'''. |
| − | It is widely believed that Fully Homomorphic Encryption (FHE) only is sufficient to provide the security of cloud computations. However, Marten van Dijk in a recent paper showed that in some cases cryptography alone can’t enforce the | + | It is widely believed that Fully Homomorphic Encryption (FHE) only is sufficient to provide the security of cloud computations. However, Marten van Dijk and Ari Juels in a recent paper showed that in some cases cryptography alone can’t enforce the |
| − | privacy demanded by common cloud computing services, even with such powerful tools as FHE. Can we bypass this impossibility result? What | + | privacy demanded by common cloud computing services, even with such powerful tools as FHE. Can we bypass this impossibility result? What extra requirements should be imposed a model of cloud computations to guarantee the privacy? These and other questions concerning the sequrity issues of cloud computing will be discussed. |
| align = "center"| Н.П. Варновский | | align = "center"| Н.П. Варновский | ||
|- | |- | ||
Версия 12:12, 1 октября 2014
Спецсеминар проходит по пятницам с 16:20 до 17:55, ауд. 508.
Начало работы спецсеминара 3 октября 2014 г.
Тематика семинара
Математические модели программ и вычислений.
Формальные методы анализа и верификации программ.
Проблема эквивалентности и эквивалентных преобразований в моделях вычислений.
Семинар проводится совместно с научно-исследовательским семинаром Математическая криптография (рук. М.И. Анохин, Н.П. Варновский).
Руководители
Расписание докладов
| Дата | Тема доклада | Докладчик |
|---|---|---|
| 03 октября | Computational privacy in public clouds. Beyond the impossibility result.
It is widely believed that Fully Homomorphic Encryption (FHE) only is sufficient to provide the security of cloud computations. However, Marten van Dijk and Ari Juels in a recent paper showed that in some cases cryptography alone can’t enforce the privacy demanded by common cloud computing services, even with such powerful tools as FHE. Can we bypass this impossibility result? What extra requirements should be imposed a model of cloud computations to guarantee the privacy? These and other questions concerning the sequrity issues of cloud computing will be discussed. |
Н.П. Варновский |
| 10 октября | Конечные автоматы в теории алгебраических моделей программ (методологический обзор). | Р.И. Подловченко |
Ссылки
<references/>
