Provable Security Under_docx
نویسندگان
چکیده
Virtualization is the mechanism that provides users a way to use many Operating Systems (OS) without need to reboot the system to shift one to another. If an adversary compromises any guest then virtual monitor (XEN in this context) has no reject any request from that OS. There is no formal proof that this virtual monitor provides security from them. We use virtualized system infrastructure of Xen hypervisor to prove that the system is secure. Any request should be sent by an hypercall to XEN. So we consider here proving the security of these hypercalls. The proof is done using the concept of Random Oracle Model. Only the hypercall security issue of the hypervisor have been dealt with. The hypercall system is proved secure under control data attacks through cipher text attack, either known message text or chosen message attacks. We express our gratitude to Prof. Shrisha Rao for his guidance and advice. We would like to thank him for constant encouragement, support and valuable suggestions throughout the project. We take this opportunity to thank institute, team members for their support throughout the project.
منابع مشابه
Practice-Oriented Provable-Security
This short article is intended to complement my talk. I would like to try to introduce you to a certain, relatively new sub-area of cryptography that we have been calling practice-oriented provable-security. It is about applying the ideas of “provably security” to the derivation of practical, secure protocols. I believe it is a fruitful blend of theory and practice that is able to enrich both s...
متن کاملProbabilistic Relational Hoare Logics for Computer-Aided Security Proofs
The provable security paradigm originates from the work of Goldwasser and Micali [10] and plays a central role in modern cryptography. Since its inception, the focus of provable security has gradually shifted towards practice-oriented provable security [4]. The central goal of practice-oriented provable security is to develop and analyze efficient cryptographic systems that can be used for prac...
متن کاملToward Provable Security Against Differential and Linear Cryptanalysis for Camellia and Related Ciphers
We present a new algorithm that evaluates provable security against differential and linear cryptanalysis for Feistel ciphers with invertible substitution-diffusion (SD)-based round functions. This algorithm computes an upper bound on the maximum expected differential or linear probability (MEDP or MELP) based on the number of rounds. We then apply our algorithm to Camellia (minus FL/FL). Previ...
متن کاملProvable Security in Cryptography
These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key Schemes” [24], on Victor Shoup’s tutorial on game playing techniques [30], on Coron’s Crypto’00 paper on the exact security of the Full Doma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010