1,854 reputation
18
bio website
location
age
visits member for 1 year, 4 months
seen Nov 23 at 10:45

Feb
9
comment Computationaly hard detokenization algorithm for credit card numbers
Yes, $V$ should respond with any secrets. I've fixed it. There are no long-term secrets in the solution, so it doesn't matter.
Feb
9
revised Computationaly hard detokenization algorithm for credit card numbers
Fixed the 'compromise' message, improved last paragraph.
Feb
8
comment Computationaly hard detokenization algorithm for credit card numbers
I think so. I've added a paragraph at the end.
Feb
8
revised Computationaly hard detokenization algorithm for credit card numbers
How to increase cost of tokenization.
Feb
7
answered One-way permutation over a small interval?
Feb
6
answered Computationaly hard detokenization algorithm for credit card numbers
Feb
5
comment Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
The Wikipedia page on cryptographically secure pseudo-random generators isn't a good reference, because it requires "backtracking resistance", which is non-standard. Also, the best definition of pseudo-random generator uses indistinguishability, not next-bit-unpredictability. The two notions are equivalent, of course, but the indistinguishability definition is best.
Feb
5
answered Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
Feb
4
revised Perfect Secrecy -> One Time Semantic Security -> Secure PRG
added 501 characters in body
Feb
4
comment Perfect Secrecy -> One Time Semantic Security -> Secure PRG
Supposedly: Andrew C. Yao. Theory and Applications of Trapdoor Functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80– 91. IEEE Computer Society, 1982.
Feb
4
comment On the Definition of a PRG and a CSPRG
fgrieu's comment above is a good answer to the question.
Feb
4
revised Perfect Secrecy -> One Time Semantic Security -> Secure PRG
added 240 characters in body
Feb
4
answered Perfect Secrecy -> One Time Semantic Security -> Secure PRG
Jan
30
answered Derive both MAC and AES keys from same PBKDF2?
Jan
12
revised Difference between CBC-MAC and CMAC
added 110 characters in body
Jan
12
answered Difference between CBC-MAC and CMAC
Jan
9
answered Why does DSS have such formulas?
Jan
6
awarded  Custodian
Jan
6
reviewed Approve How does Clifford Cocks 'Non-Secret Encryption' work?
Dec
27
comment EC ElGamal versus static+ephemeral ECDH
ElGamal is a DH key exchange where the recipient has a fixed DH message (the public key), and the key is used to encrypt the message using a one-time shift cipher. ECIES is a DH key exchange where the recipient has a fixed DH message (the public key), and the key is used to encrypt the message using a secure one-time symmetric cryptosystem.