meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | 2 hours ago | |
| stats | profile views | 137 |
|
May 5 |
answered | Is there any strong enough pen-and-paper or mind cipher? |
|
May 3 |
awarded | Nice Answer |
|
May 1 |
revised |
Is it worth applying a MAC on data in a HSM? added 195 characters in body |
|
May 1 |
answered | Is it worth applying a MAC on data in a HSM? |
|
May 1 |
comment |
What does the expression $1^n$ mean as a function argument? @HenrickHellström, maybe I'd better narrow my comments. As a simple starter, the answer claims "there are $2^n$ possible attribute values", but this does not appear to be correct. It appears there are $N^n$ possible attribute values (as the set of attributes is $Z_N^n$); certainly it's a lot more than $2^n$. (OK, the attribute $(a_1,\dots,a_n)$ might be equivalent to $(2a_1,\dots,2a_n)$, but even then there would still be at least $N^{n-1}$ non-equivalent attribute values.) |
|
May 1 |
revised |
Secure encrypt-then-sign with RSA added 2426 characters in body |
|
May 1 |
answered | Secure encrypt-then-sign with RSA |
|
May 1 |
comment |
Useful pairings for cryptography @EdvardFagerholm, unless you can somehow narrow down the question somehow, I don't think you're going to get a more useful answer than the characterization "groups where the BDH problem is hard". I don't think we have a complete characterization of what groups the BDH problem is hard in, based solely upon clean/elementary properties of the group. |
|
May 1 |
comment |
What does the expression $1^n$ mean as a function argument? @HenrickHellström, thanks, I see what you mean about more going on here. I still don't think this answer is quite right, though. The set of attributes is $Z_N^n$, where $N$ is a large integer; thus, there are $N^n$ possible attribute values, not $2^n$. There is no reason why $1^n=(1,1,\dots,1)$ would be a particularly special or interesting attribute value. Therefore, I believe that $1^n$ is passed to the Setup routine for the reasons in my answer (force it to be polytime in $n$), not anything to do with representing the set of all predicates/attributes. |
|
May 1 |
revised |
What does the expression $1^n$ mean as a function argument? deleted 1 characters in body |
|
May 1 |
comment |
Why does key generation take an input $1^k$, and how do I represent it in practice? Great point, @RickyDemer! Thanks. I've edited it, and I think I fixed it, but let me know if I missed any spots. |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 145 characters in body |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 175 characters in body |
|
May 1 |
revised |
What does the expression $1^n$ mean as a function argument? added 156 characters in body |
|
May 1 |
comment |
What does the expression $1^n$ mean as a function argument? Henrick, your answer sounds plausible on the surface, but when I read the paper, it's pretty clear that it is not correct. The real story is that $1^n$ is a security parameter (as the paper states in Definition 1), not some representation of hidden predicates, and the real explanation is the one given at crypto.stackexchange.com/q/8174/351 |
|
May 1 |
comment |
What does the expression $1^n$ mean as a function argument? If you want to understand why the $1^n$ is there and what purpose it solves, see crypto.stackexchange.com/q/8174/351. |
|
May 1 |
comment |
Why does key generation take an input $1^k$, and how do I represent it in practice? I've edited the question to be more general, so that it'll be helpful to others as well. (As it turns out, this question is not specific to the McEliece cryptosystem.) |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 179 characters in body; edited tags; edited title |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 487 characters in body |
|
May 1 |
answered | Why does key generation take an input $1^k$, and how do I represent it in practice? |
