3,700 reputation
1621
bio website
location United States
age
visits member for 3 years
seen 6 hours ago

6h
revised Is there any probabilistic version of RSA?
improved grammar
14h
comment Large file validation on an embedded system through hash and encryption
It would probably be better to sign "the MD5 hash with a private key and return" a signed "hash to the embedded system", rather than trying to use encryption for that purpose. $\;$
19h
comment Secure way to derive separate encryption and MAC keys from a single master key?
@owlstead : $\;\;\;\;$ "for less structured" $\: \mapsto \:$ "for more structured" $\;\;$ ? $\;\;\;\;\;\;\;\;\;$
1d
revised Format Preserving Encryption for 32 or 64 bit plaintext values
mentioned _direct_ tweakability
1d
awarded  Yearling
1d
revised How are salt values more secure?
improved grammar
1d
comment Operation which needs much computing power to be created, but just a little to be solved?
The "just a little to be solved" part is easy: declare that 0 is always a solution. $\;$
1d
comment Operation which needs much computing power to be created, but just a little to be solved?
@StephenTouset : $\:$ How? $\;\;\;\;$
1d
comment How to compute 3P from elliptic curve where P is (28, 8)
... for what EC group? $\;$
2d
comment Format Preserving Encryption for 32 or 64 bit plaintext values
I would recommend using HMAC, since it is presumably a secure PRF. $\:$ I have no idea what the impact on performance would be. $\;\;\;\;$
2d
answered Format Preserving Encryption for 32 or 64 bit plaintext values
Oct
20
comment Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?
@TravisMayberry : $\:$ That depends on what the PRF takes as input. $\;\;\;\;$
Oct
20
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"? $\;\;\;\;\;\;\;$
Oct
19
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.
Oct
19
revised Can we run a probabilistic function on ciphertext with Functional Encryption (or Attribute Based Encryption)?
improved grammar
Oct
18
revised Why can't garbled circuits be reused?
fixed title's grammar
Oct
17
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 $\;$