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 encryption
Search options not deleted
user 1991
Encryption is the process of transforming plaintext using a cipher into ciphertext to make it unreadable to anyone except those possessing the key. Decryption is the process of transforming that ciphertext back into plaintext, using the key.
15
votes
Accepted
Help in understanding exactly how lattices are used as one-way functions for hashing
I'm also afraid you couldn't understand this as D.W., but let us start.
I sometimes cannot understand your questions. Please restate them, if possible.
The definition of the Ajtai hash functions
Let …
- 2,186
8
votes
Accepted
Can we proxy-re-encrypt using homomorphic encryption schemes?
It is pointed out by Gentry (in his thesis) when he consider bootstrapping and re-encryption.
Let us denote the old key pair by $(PK, SK)$ and the new key pair by $(PK^1, SK^1)$. … This is just re-encryption Gentry suggested in his thesis. …
- 2,186
2
votes
Zero-Knowledge Challenge-Responce Protocol
Reading the original paper, I figure out the question.
This voting scheme employed the well-known undeniable signature scheme, proposed by Chaum and Van Antwerpen in 1989 (or Chaum 1990 or Chaum and V …
- 2,186