Reputation
962
Top tag
Next privilege 1,000 Rep.
Edit questions and answers
Badges
7 11
Newest
 Yearling
Impact
~38k people reached

  • 0 posts edited
  • 0 helpful flags
  • 13 votes cast
Aug
12
comment Can ECDSA signatures be safely made “deterministic”?
Exactly, my question was related to a single signature. Thanks for the answer. Any way we can enforce this requirement, i.e., verify if it was deterministically generated using the given hash? (we probably need a special hash). Does the question even make sense? :)
Aug
12
comment Can ECDSA signatures be safely made “deterministic”?
Is it possible to verify if a signature was deterministic or not?
Jul
12
awarded  Yearling
Jun
23
awarded  Caucus
Jun
13
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
deleted 5 characters in body
Jun
13
comment Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Thanks for the ref. Some related questions: Suppose $n$ is composite and hard to factor. Which of the problems in Ch 21 are reducible? (1) Can Inverse-DH be reduced to Fixed-Inverse-DH? (2) Can Fixed-Inverse-DH be reduced to Fixed-DH?
Jun
13
accepted Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Jun
13
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
deleted 61 characters in body
Jun
13
awarded  Curious
Jun
12
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
added 279 characters in body
Jun
12
revised Definition of indistinguishable schemes
added 39 characters in body
Jun
12
answered Definition of indistinguishable schemes
Jun
12
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
added 66 characters in body
Jun
12
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
added 25 characters in body
Jun
12
comment Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
@SOJPM; $(O(g^x))^x = g\in G$ (not $\bmod{n}$). Edited question to make this clear.
Jun
12
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
deleted 23 characters in body
Jun
12
revised Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
deleted 23 characters in body
Jun
12
asked Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Oct
30
comment Public key encryption without ciphertext expansion
It is strictly for use in a deterministic sense. By specifying VARCHAR(255), I assume that it is a deterministic permutation between 0 .. 2^(8*255).
Oct
30
comment Public key encryption without ciphertext expansion
@DrLecter Several reasons I would need it. The app is running on cloud and stores the data on cloud. The app only writes the data but does not need to read it. Then I would like to use public key encryption to protect it from the cloud provider.