Questions and Answers
In the years I spent browsing the stackexchange network, I devoted quite an amount of time answering questions about cryptography, from the most basic ques...
Posts by Tag
- cryptography stackexchange 5
- assumptions 2
- probabilities 1
- LPN 1
- Linear tests 1
- primitives 1
- foundations 1
- secure computation 1
- zero-knowledge 1
- latex 1
cryptography stackexchange
[Q&A] Zero-Knowledge Proofs
General questions How to explain ZK proofs to a 7 year old? Are there lower bounds on the size and interaction of a ZK proof with a given soundness e...
[Q&A] Secure Computations
Constructing MPC Protocols How to multiply two additively shared values? How can two parties conditionally disclose a secret to a third party? How ...
[Q&A] Foundations of cryptography
Do OWF imply $\mathsf{P} \neq \mathsf{NP}?$ (short answer: yes) How does the random oracle model help with constructing secure cryptographic primitive...
[Q&A] Cryptographic Primitives and Assumptions
Public-Key Encryption Is the RSA cryptosystem provably secure? Are there public-key cryptosystems not relying on arithmetic over finite fields? (shor...
assumptions
[Q&A] Cryptographic Primitives and Assumptions
Public-Key Encryption Is the RSA cryptosystem provably secure? Are there public-key cryptosystems not relying on arithmetic over finite fields? (shor...
Learning Parity with Noise versus Linear Tests
The learning parity with noise assumption (LPN) is one of the most fundamental assumptions of cryptography. It states that given a random secret vector $\v...
probabilities
Probabilities and Counting – Cheat Sheet
In the course of working on various projects, I found myself spending an excessive amount of time skimming through textbooks and Wikipedia pages to be remi...
LPN
Learning Parity with Noise versus Linear Tests
The learning parity with noise assumption (LPN) is one of the most fundamental assumptions of cryptography. It states that given a random secret vector $\v...
Linear tests
Learning Parity with Noise versus Linear Tests
The learning parity with noise assumption (LPN) is one of the most fundamental assumptions of cryptography. It states that given a random secret vector $\v...
primitives
[Q&A] Cryptographic Primitives and Assumptions
Public-Key Encryption Is the RSA cryptosystem provably secure? Are there public-key cryptosystems not relying on arithmetic over finite fields? (shor...
foundations
[Q&A] Foundations of cryptography
Do OWF imply $\mathsf{P} \neq \mathsf{NP}?$ (short answer: yes) How does the random oracle model help with constructing secure cryptographic primitive...
secure computation
[Q&A] Secure Computations
Constructing MPC Protocols How to multiply two additively shared values? How can two parties conditionally disclose a secret to a third party? How ...
zero-knowledge
[Q&A] Zero-Knowledge Proofs
General questions How to explain ZK proofs to a 7 year old? Are there lower bounds on the size and interaction of a ZK proof with a given soundness e...
latex
Basic LaTeX Template for Writing Crypto Papers
The aim of this post is to provide a simple, ready-for-use LaTeX article template for writing research papers on cryptography. This is the setup I generall...