1,083 reputation
614
bio website
location
age
visits member for 2 years, 8 months
seen 1 min ago

Jul
18
comment Solve a system of non linear equations over GF
What if at your initial equations you only know $y_1-y_0$ and not the actual values of '$y_0$' and '$y_1$' and the same for the second equation? Is the system still solvable?
Jul
18
accepted Where i can find an AES implementation in python?
Jul
13
answered Best hash size for hash trees
Jul
11
revised plaintext and its encrypted version known
typo errors
Jul
11
suggested suggested edit on plaintext and its encrypted version known
Jul
11
answered Which area of Maths should I pursue?
Jul
2
answered Resources for basics of lattice crypto
Jun
15
answered Can cryptography be used to hide routing information from the router?
Jun
14
comment Encrypting and MACing different data with same key
As a side question part of this. Is it safe to authenticate different data with the same MAC key?
Jun
11
answered Differential privacy definition
Jun
10
comment Is it possible to anonymize web traffic so that the IP Address cannot be determined while still being able to determine distinct IPs?
You can authorize only owners of a secret key to encrypt with this key E(H(H(key||ip))
Jun
10
answered Is it possible to anonymize web traffic so that the IP Address cannot be determined while still being able to determine distinct IPs?
Jun
10
comment How to compare two datasets „anonymously”?
There is no order in a privacy preserving set intersection protocol. Only equality
May
31
comment Acceptable assumptions when proving security
If you assume that they are random you immediately are finished with the proof. In general you define how the ideal object of the cryptographic primitive you want to prove looks like. For instance for hash functions you assume the existence of a perfect hash functions with random output. Then going down into your construction you prove that your construction is close to the ideal one. For data confidentiality the proof of secure encryption schemes implies indistinguishability between given ciphertexts. This proofs are formulated with simulation games CPA,CCA,...
May
28
revised what actually the function for e(g,g)^xy
deleted 10 characters in body
May
27
revised what actually the function for e(g,g)^xy
added 15 characters in body
May
27
answered what actually the function for e(g,g)^xy
May
21
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
These seem as notes from coursera Dan Boneh's crypto course
May
16
comment Is Functional Encryption about Access Control over encrypted data alone?
I explain you clearly with arguments on the base difference. Two constructions for different purposes. Argue for that and if you don't agree or i am mistaken explain please. don't cite
May
16
comment Is Functional Encryption about Access Control over encrypted data alone?
@sashank. There are no connections at all. In FHE you produce the encrypted version of an operation on encrypted data. In functional encryption you learn the result of a function applied on encrypted data