bio | website | |
---|---|---|
location | ||
age | 22 | |
visits | member for | 3 years, 2 months |
seen | Nov 2 '14 at 23:01 | |
stats | profile views | 88 |
May 29 |
comment |
Determining the maximum number of distance relationships that can be defined between points in Euclidean space
Hi Anton, I'm not sure whether the solutions there can be extended to $ \mathbb R ^n$, but thanks for the tip. |
May 28 |
comment |
Determining the maximum number of distance relationships that can be defined between points in Euclidean space
In comment 1, I assume you mean "quadrilateral" rather than "square" and in comment 3, "distances" rather than "questions"? In any case, thanks for pointing out the issue of the quadrilateral inequality. I'm looking at reformulating the question by replacing the condition on the triangle inequality with the following condition -- There exist $a$ points ${P_1, P_2, ... P_a}$ where all the distances $P_i P_{i+1}$ are defined and $P_1 P_a>P_1 P_2+P_2 P_3 +...+P_{a-1}P_a$. However, does it make the question trivial? |
May 28 |
awarded | Cleanup |
May 28 |
revised |
Determining the maximum number of distance relationships that can be defined between points in Euclidean space
rolled back to a previous revision |
May 28 |
accepted | Determining the maximum number of distance relationships that can be defined between points in Euclidean space |
May 28 |
awarded | Editor |
May 28 |
revised |
Determining the maximum number of distance relationships that can be defined between points in Euclidean space
Edited question to exclude cases pointed out by @Will |
May 28 |
comment |
Generating a set of integer passwords that can be securely authenticated
Hi Aaron, thanks for your suggestion regarding the function $S(x)$, I think it would nicely help to expand a solution for a single individual to multiple individuals in most cases. However, I've read up some of the literature on threshold schemes and am still not sure how the solutions are applicable to my problem. In this problem, only one person's password is required to know everything, so as @max mentioned it's the special case where k=1. Or am I missing something here. |
May 28 |
awarded | Scholar |
May 28 |
awarded | Supporter |
May 28 |
accepted | Generating a set of integer passwords that can be securely authenticated |
May 28 |
comment |
Generating a set of integer passwords that can be securely authenticated
I was familiar with the encryption aspect of public-key cryptography but not with its application in digital signature schemes! Thanks for pointing me there - I think the solution is simply and works! |
May 27 |
asked | Determining the maximum number of distance relationships that can be defined between points in Euclidean space |
May 27 |
comment |
Generating a set of integer passwords that can be securely authenticated
Hi Federico, I'm not sure how exactly the safe would authenticate the user's private key as being correct. Could you elaborate on this? |
May 27 |
comment |
Generating a set of integer passwords that can be securely authenticated
Hi @Max, I read up on the secret sharing scheme, and, based on what I've understood, I think that problem and the one I've posed could be related but are not the same. In fact, I believe that secret sharing is only "interesting" when $k>1$. Substituting $k=1$ into most solutions for the secret-sharing schemes I've found do not address conditions 2 & 3 since they are not designed to. |
May 27 |
comment |
Generating a set of integer passwords that can be securely authenticated
@zeb That sounds like a pretty good solution! When you say that there is no guarantee that factoring is hard, do you mean that the system would be approximately as secure as encryption schemes like the RSA algorithm? |
May 27 |
awarded | Student |
May 27 |
asked | Generating a set of integer passwords that can be securely authenticated |