Mixing
What is the purpose of Homomorphic encryption?
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
Homogeneous cryptography is a kind of cryptography that allows you to do special math operations on the ciphertext, and the maths performed are identical to the obvious ones. For example, one person can combine two cached numbers, and decode the result, the sum will be two numbers. Among the commonly used cryptographic applications, one can refer to secure voting systems.Homomorphic encryption
- What is the purpose of Homomorphic encryption?
- How can it create secure systems such as secure voting systems?
encryption homomorphic-encryption
asked 3 hours ago
R1w
37417
add a comment |Â
up vote
3
down vote
favorite
Homogeneous cryptography is a kind of cryptography that allows you to do special math operations on the ciphertext, and the maths performed are identical to the obvious ones. For example, one person can combine two cached numbers, and decode the result, the sum will be two numbers. Among the commonly used cryptographic applications, one can refer to secure voting systems.Homomorphic encryption
- What is the purpose of Homomorphic encryption?
- How can it create secure systems such as secure voting systems?
encryption homomorphic-encryption
asked 3 hours ago
R1w
37417
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
Homogeneous cryptography is a kind of cryptography that allows you to do special math operations on the ciphertext, and the maths performed are identical to the obvious ones. For example, one person can combine two cached numbers, and decode the result, the sum will be two numbers. Among the commonly used cryptographic applications, one can refer to secure voting systems.Homomorphic encryption
- What is the purpose of Homomorphic encryption?
- How can it create secure systems such as secure voting systems?
encryption homomorphic-encryption
asked 3 hours ago
R1w
37417
Homogeneous cryptography is a kind of cryptography that allows you to do special math operations on the ciphertext, and the maths performed are identical to the obvious ones. For example, one person can combine two cached numbers, and decode the result, the sum will be two numbers. Among the commonly used cryptographic applications, one can refer to secure voting systems.Homomorphic encryption
- What is the purpose of Homomorphic encryption?
- How can it create secure systems such as secure voting systems?
encryption homomorphic-encryption
encryption homomorphic-encryption
asked 3 hours ago
R1w
37417
asked 3 hours ago
R1w
37417
edited 3 hours ago
asked 3 hours ago
R1w
37417
asked 3 hours ago
R1w
37417
asked 3 hours ago
R1w
37417
37417
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago
add a comment |Â
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
Homomorphic encryption let's you encrypt data, do operations / calculations with it such that when you decrypt the result, it's as if the same operations were done on the plaintext instead of the cyphertext.
The use of this is that untrusted parties can do computation on sensitive data.
This lets you use computing power of people you might not trust with your data, like using publically available cloud computing services on your personal financial data.
Another usage case if it ever gets more applicable is in video games.
Some type of games (specifically real time strategy games) are programmed such that every player needs to know about every other player's data due to being a deterministic simulation. Homomorphic encryption would allow deterministic simulation without players being able to cheat and get info about what other players are doing.
answered 1 hour ago
Alan Wolfe
220112
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
add a comment |Â
up vote
1
down vote
First, I just copy-paste the introduction of homomorphic encryption from Wikipedia here
Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computation on encrypted data.
For its applications (which demonstrate its purpose), here is Gentry's introduction in his famous thesis:
Fully homomorphic encryption has numerous applications. For example, it enables private queries to a search engine – the user submits an encrypted query and the search engine computes a succinct encrypted answer without ever looking at the query in the clear. It also enables searching on encrypted data – a user stores encrypted files on a remote file server and can later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, fully homomorphic encryption improves the efficiency of secure multiparty computation.
Finally, homomorphic encryption is only part of secure voting systems. See here: Homomorphic encryption used for e-voting?
answered 13 mins ago
Shan Chen
79039
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Homomorphic encryption let's you encrypt data, do operations / calculations with it such that when you decrypt the result, it's as if the same operations were done on the plaintext instead of the cyphertext.
The use of this is that untrusted parties can do computation on sensitive data.
This lets you use computing power of people you might not trust with your data, like using publically available cloud computing services on your personal financial data.
Another usage case if it ever gets more applicable is in video games.
Some type of games (specifically real time strategy games) are programmed such that every player needs to know about every other player's data due to being a deterministic simulation. Homomorphic encryption would allow deterministic simulation without players being able to cheat and get info about what other players are doing.
answered 1 hour ago
Alan Wolfe
220112
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
add a comment |Â
up vote
1
down vote
accepted
Homomorphic encryption let's you encrypt data, do operations / calculations with it such that when you decrypt the result, it's as if the same operations were done on the plaintext instead of the cyphertext.
The use of this is that untrusted parties can do computation on sensitive data.
This lets you use computing power of people you might not trust with your data, like using publically available cloud computing services on your personal financial data.
Another usage case if it ever gets more applicable is in video games.
Some type of games (specifically real time strategy games) are programmed such that every player needs to know about every other player's data due to being a deterministic simulation. Homomorphic encryption would allow deterministic simulation without players being able to cheat and get info about what other players are doing.
answered 1 hour ago
Alan Wolfe
220112
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
add a comment |Â
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Homomorphic encryption let's you encrypt data, do operations / calculations with it such that when you decrypt the result, it's as if the same operations were done on the plaintext instead of the cyphertext.
The use of this is that untrusted parties can do computation on sensitive data.
This lets you use computing power of people you might not trust with your data, like using publically available cloud computing services on your personal financial data.
Another usage case if it ever gets more applicable is in video games.
Some type of games (specifically real time strategy games) are programmed such that every player needs to know about every other player's data due to being a deterministic simulation. Homomorphic encryption would allow deterministic simulation without players being able to cheat and get info about what other players are doing.
answered 1 hour ago
Alan Wolfe
220112
Homomorphic encryption let's you encrypt data, do operations / calculations with it such that when you decrypt the result, it's as if the same operations were done on the plaintext instead of the cyphertext.
The use of this is that untrusted parties can do computation on sensitive data.
This lets you use computing power of people you might not trust with your data, like using publically available cloud computing services on your personal financial data.
Another usage case if it ever gets more applicable is in video games.
Some type of games (specifically real time strategy games) are programmed such that every player needs to know about every other player's data due to being a deterministic simulation. Homomorphic encryption would allow deterministic simulation without players being able to cheat and get info about what other players are doing.
answered 1 hour ago
Alan Wolfe
220112
answered 1 hour ago
Alan Wolfe
220112
answered 1 hour ago
Alan Wolfe
220112
answered 1 hour ago
Alan Wolfe
220112
220112
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
add a comment |Â
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
1
1
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
The "use computing power of people you might not trust" thing is largely theoretical. Problem is, encryption and decryption of the data tends to be a more expensive than the calculation itself would be, and the computing power needed by the untrusted party a lot more expensive.
– fgrieu
46 mins ago
add a comment |Â
up vote
1
down vote
First, I just copy-paste the introduction of homomorphic encryption from Wikipedia here
Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computation on encrypted data.
For its applications (which demonstrate its purpose), here is Gentry's introduction in his famous thesis:
Fully homomorphic encryption has numerous applications. For example, it enables private queries to a search engine – the user submits an encrypted query and the search engine computes a succinct encrypted answer without ever looking at the query in the clear. It also enables searching on encrypted data – a user stores encrypted files on a remote file server and can later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, fully homomorphic encryption improves the efficiency of secure multiparty computation.
Finally, homomorphic encryption is only part of secure voting systems. See here: Homomorphic encryption used for e-voting?
answered 13 mins ago
Shan Chen
79039
add a comment |Â
up vote
1
down vote
First, I just copy-paste the introduction of homomorphic encryption from Wikipedia here
Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computation on encrypted data.
For its applications (which demonstrate its purpose), here is Gentry's introduction in his famous thesis:
Fully homomorphic encryption has numerous applications. For example, it enables private queries to a search engine – the user submits an encrypted query and the search engine computes a succinct encrypted answer without ever looking at the query in the clear. It also enables searching on encrypted data – a user stores encrypted files on a remote file server and can later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, fully homomorphic encryption improves the efficiency of secure multiparty computation.
Finally, homomorphic encryption is only part of secure voting systems. See here: Homomorphic encryption used for e-voting?
answered 13 mins ago
Shan Chen
79039
add a comment |Â
up vote
1
down vote
up vote
1
down vote
First, I just copy-paste the introduction of homomorphic encryption from Wikipedia here
Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computation on encrypted data.
For its applications (which demonstrate its purpose), here is Gentry's introduction in his famous thesis:
Fully homomorphic encryption has numerous applications. For example, it enables private queries to a search engine – the user submits an encrypted query and the search engine computes a succinct encrypted answer without ever looking at the query in the clear. It also enables searching on encrypted data – a user stores encrypted files on a remote file server and can later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, fully homomorphic encryption improves the efficiency of secure multiparty computation.
Finally, homomorphic encryption is only part of secure voting systems. See here: Homomorphic encryption used for e-voting?
answered 13 mins ago
Shan Chen
79039
First, I just copy-paste the introduction of homomorphic encryption from Wikipedia here
Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computation on encrypted data.
For its applications (which demonstrate its purpose), here is Gentry's introduction in his famous thesis:
Fully homomorphic encryption has numerous applications. For example, it enables private queries to a search engine – the user submits an encrypted query and the search engine computes a succinct encrypted answer without ever looking at the query in the clear. It also enables searching on encrypted data – a user stores encrypted files on a remote file server and can later have the server retrieve only files that (when decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own. More broadly, fully homomorphic encryption improves the efficiency of secure multiparty computation.
Finally, homomorphic encryption is only part of secure voting systems. See here: Homomorphic encryption used for e-voting?
answered 13 mins ago
Shan Chen
79039
answered 13 mins ago
Shan Chen
79039
answered 13 mins ago
Shan Chen
79039
answered 13 mins ago
Shan Chen
79039
79039
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f62386%2fwhat-is-the-purpose-of-homomorphic-encryption%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Could you provide reference to Homogeneous cryptography, please?
– Hilder Vitor Lima Pereira
3 hours ago
You made an edit in which you added a link to Wikipedia's article about Homomorphic Encryption. But what do you mean by Homogeneous cryptography?
– Hilder Vitor Lima Pereira
38 mins ago
@HilderVitorLimaPereira my question is about: How can it create secure systems such as secure voting systems?
– R1w
34 mins ago