Ca’ Foscari University of Venice announces 10 PhD positions (6 with scholarship) in Computer Science. The programme is three years long in a context where all the graduate programmes (Master and PhD) are taught in English.
PhD students will have the opportunity to do their work inside the well-established research centres:
- ACADIA (AdvanCes in Autonomous, DIstributed and pervAsive systems)
- KIIS (Knowledge, Interaction and Intelligent Systems)
In particular, secgroup@unive proposes PhD research projects on the following topics:
1) Analysis of Security APIs
2) Models and tools for highly secure systems
Research will be done under my guidance in the very stimulating context of secgroup@unive also known as c00kies@venice in hacking competitions. For topic 1 it will be possible a collaboration with the spin-off Cryptosense.
Application deadline is 27th May 2013 – at 12:00 pm (CEST). More information and on-line application available here.
The page provided appears to be a pseudo random number generator. By reading the page source we can retrieve the PHP sources of the challenge and the flag location (not directly readable)
Continue reading “HACKYOU CTF 2012 write-up: Web 300”
Here is the description of the challenge:
CryptoMat is a site where you can send encrypted messages to other users. Dog is a user on the site and has the key. Figure out how to get into his account and obtain it.
The first thing we had to do was finding out how the encryption algorithm works. After a few attempts, we discovered that the title wasn’t used for the encryption and that, given a plaintext and a key , we have
Continue reading “CSAW CTF 2012 write-up: CryptoMat (web400)”
I’ve published a hands-on guide to Padding Oracle Attacks on RSA that appears in Hakin9 – Defend Yourself! Hands-on Cryptography. It is a practical experience on how to break RSA using a side-channel and contains references to our recent results on real devices.
An article on our paper “Efficient Padding Oracle Attacks on Cryptographic Hardware“, to appear at CRYPTO 2012 this August, has been published today on the New-York Times. The news seems to be bouncing back and forth on many blogs, sometimes imprecise and exaggerated. Our FAQ page should clarify any doubt you might have. If you are curious and you don’t want to go through the full paper, Matthew Green’s blog provides a very nice write-up.
The following description is provided:
Robots enjoy some strange games and we just can’t quite figure this one out. Maybe you will have better luck than us.
The game offers a choice between two hex strings asking for the “bigger” one. Anyway, it doesn’t appear to be a way to determine which one is bigger just by looking at the values.
Continue reading “PlaidCTF 2012 write-up: The Game”
Our paper about automated analysis of grsecurity has been accepted for presentation at IEEE CSF 2012 at the end of June. In the paper we formalize grsecurity semantics and, based on that, we develop a tool that checks for security flaws inside real grsecurity policies. The paper is based on Marco Squarcina’s undergraduate thesis (tesi triennale).
The gran tool (grsecurity analyser) is available for download here.
Last week we participated in the ENOWARS 2011 CTF, a Capture-The-Flag event organized by TU-Berlin in cooperation with the INFORMATIK 2011 conference. We placed 3rd out of 46 teams after struggling for the entire game with Leet More and Ring0! Thanks to ENOFLAG for the challenging CTF!
The challenge consists of the following description:
Hey! I am sure, Dark Viewer is writing down every little poop he did. Just trying to get the infos by searching for his diary. Shit. Its encrypted but what is the key…
Lets try break it!!
Continue reading “ENOWARS 2011 CTF Write-up: Diary”
This challenge shares the same source code as the bin2 challenge, but the environment is different:
we need to bypass ASLR and we can’t overwrite the GOT nor the .dtors section (because of RELRO).
We will bypass those protections using a ROP approach.
Continue reading “CSAW CTF 2011 Write-up: Exploitation bin4”