3,690 reputation
1521
bio website
location United States
age
visits member for 2 years, 11 months
seen 36 mins ago

1h
comment Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?
@JianLiu : $\;\;\;$ If $sk_f$ can be quantum, then it might be possible "to prevent Bob from providing the same randomness to $\hspace{.04 in}f$" every time. $\:$ There are non-deterministic PRNGs, but that would just move the problem to preventing "Bob from providing the same" entropy to the PRNG every time. $\:$ Do invoker-randomizable PRFs count as "non-deterministic"? $\;\;\;\;\;\;\;$
7h
comment Learnable with oracle query
"learnable using membership queries" and "learnable with oracle queries" are each significantly $\hspace{.42 in}$ easier to interpret than "learnable with oracle query". $\;$
8h
comment Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?
You could instead "contain within $f$ a" PRF, so that Bob can only provide "the same randomness to $f$" on each call with the same input.
10h
revised Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?
improved grammar
2d
revised Why can't garbled circuits be reused?
fixed title's grammar
2d
revised How can I break this cipher?
improved grammar
Oct
17
comment Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack
No; I'm just making sure you're aware that EUF-CMA is not the strongest notion. $\;$
Oct
17
comment Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack
(Also: Have you seen "the concept of" Strong "Unforgeability of signature" schemes "against Adaptive Chosen Message Attack"?) $\;$
Oct
17
comment Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack
csee.wvu.edu/~xinl/library/papers/comp/goldwasser1988.pdf $\;$
Oct
16
comment Cryptography system that limits the length of the encypted message
That only affects how easy/hard it will be to do format-preserving encryption $\hspace{1.74 in}$ on the space of 160-character strings. $\;$
Oct
16
comment Cryptography system that limits the length of the encypted message
Does the list of allowed characters have an even number of elements? $\;$
Oct
15
comment Encrypted read-only message queue
You should not be encrypting "with the private key". $\:$ See this question and this answer. $\;\;\;\;$
Oct
15
comment Is there any existing cipher capable of scaling from a 1 bit key up to a one-time-pad?
Three other regions along that continuum are honey encryption, entropically-secure encryption, $\hspace{.65 in}$ and encryption that remains information-theoretically secure against key-dependent messages. $\hspace{.73 in}$
Oct
13
comment Encryption function that returns a unique number based on 3 ints
@ThomasM.DuBuisson : $\:$ However, those encodings are not just concatenation. $\hspace{.96 in}$
Oct
13
comment Encryption function that returns a unique number based on 3 ints
@ThomasM.DuBuisson : $\:$ Presumably, the reason is that there are different triples $\hspace{1.43 in}$ of integers whose concatenations are equal. $\;\;\;\;$
Oct
10
comment How does MD5 process text which is shorter than 512 bits
en.wikipedia.org/wiki/MD5#Algorithm $\;$
Oct
8
comment How do I generate a number for a lottery and later proves its existence
@tylo : $\:$ I mean a collision with short inputs. $\;\;\;\;$
Oct
7
comment How do I generate a number for a lottery and later proves its existence
@tylo : $\:$ One uses a short collision in the actual hash function. $\;\;\;\;$
Oct
6
comment How do I generate a number for a lottery and later proves its existence
The drawback "of doing this over" a perfectly binding scheme is that, for each hash function, there exists a fast way to break the binding property.
Oct
6
comment How do I generate a number for a lottery and later proves its existence
eprint.iacr.org/2011/223.pdf $\;$