<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>security on candyForThought</title><link>https://c4ndyfl1p.github.io/categories/security/</link><description>Recent content in security on candyForThought</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Tue, 30 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://c4ndyfl1p.github.io/categories/security/index.xml" rel="self" type="application/rss+xml"/><item><title>My Master's Thesis: Lattice-Based Zero-Knowledge Proofs with VOLE</title><link>https://c4ndyfl1p.github.io/posts/thesis/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0000</pubDate><guid>https://c4ndyfl1p.github.io/posts/thesis/</guid><description>In June 2026 I handed in my Master&amp;rsquo;s thesis in Computer Science at Aarhus University, titled Lattice-based Zero-knowledge proofs with VOLE in the batch setting. I was supervised by Peter Scholl and Diego F. Aranha.
Read the full thesis (PDF, 80 pages)
Here&amp;rsquo;s what it&amp;rsquo;s about, without the 80 pages.
Proving something without giving it away A zero-knowledge proof lets one party (the prover) convince another (the verifier) that a statement is true, without revealing anything beyond the fact that it&amp;rsquo;s true.</description></item><item><title>ECB cut and paste/profile forging</title><link>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge13/</link><pubDate>Fri, 21 Jul 2023 00:00:00 +0000</pubDate><guid>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge13/</guid><description>Cryptopals Challenge 13 - Profile Forging/ECB cut and paste
I solved challenge 13 of cryptopals, this is the writeup for it Relevent code can be found here: github
In the Cryptopals challenge number 13, function called profile_for() is provided. This function is capable of producing valid ciphertexts.
The profile_for() function takes an email address as its input and then encrypts the corresponding encoded profile. For example, if the email is foo@bar.</description></item><item><title>Byte at a time ECB decryption</title><link>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge12/</link><pubDate>Thu, 13 Jul 2023 00:00:00 +0000</pubDate><guid>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge12/</guid><description>Solved cyptopals, [set 2 challenge 12] Relevent code github
Lots of people know that when you encrypt something in ECB mode, you can see penguins through it. Not so many of them can decrypt the contents of those ciphertexts, and now you can
Little primer:
A block cipher is simply another name for a (strong) pseudorandom permutation. That is, a block cipher $F: \{0, 1\}^n × \{0, 1\} → \{0, 1\}$ is a keyed function such that, for all $k$, the function $F_k$ defined by $F_k(x) = F (k, x)$ is a bijection (i.</description></item><item><title>Tor:The 2nd Generation Onion Router</title><link>https://c4ndyfl1p.github.io/posts/tor/</link><pubDate>Fri, 28 Apr 2023 00:00:00 +0000</pubDate><guid>https://c4ndyfl1p.github.io/posts/tor/</guid><description>Report 2 for the final project of the course Computer Security and Privacy- tor: the 2nd gen Onion Router</description></item><item><title>Aes in CBC mode</title><link>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge11/</link><pubDate>Wed, 26 Jan 2022 00:00:00 +0000</pubDate><guid>https://c4ndyfl1p.github.io/posts/cryptopals-set2-challenge11/</guid><description>AES-CBC | I still see penguins I think this was a very experimental exercise.
edit: I did something dumb, spent more time than i&amp;rsquo;d care to admit in agony before realising the dumb thing, hence this post exists. Scroll to the bottom to save yourself some pain.
Task (cryptopals set2 challenge 11):
Write an encryption oracle with encrypts a plaintext with AES in ECB mode half the time and CBC mode other half.</description></item></channel></rss>