Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with group-theory
Search options not deleted
user 33994
Groups are an abstract algebraic concept based on a set and a group law (a binary function which closes the set).
5
votes
Accepted
Hidden order groups any pointers to reading material?
Cryptographic assumptions in hidden order groups.
Alin Tomescu: Cryptographic Assumptions in Hidden-Order Groups. This is a great overview of cryptographic assumptions in hidden-order groups. Link t …
- 1,194
3
votes
Accepted
Is this an error in the Pinocchio Protocol paper
The first part of the question is answered in the comments. Regarding the second part, yes, indeed, you are right! It's a typo in the Pinocchio paper, Section 2.3. Protocol 1., you also linked. The pr …
- 1,194
2
votes
2
answers
228
views
Proving in zero-knowledge the "sign" of a discrete logarithm in groups of unknown order
Suppose we have the description of a group $\mathbb{G}$, a group of unknown order: the size of the group is unknown. For instance, an RSA group ($\mathbb{Z}^{*}_N,$ where $N=pq$ for unknown primes $p$ …
- 1,194