meta user
network profile
| bio | website | |
|---|---|---|
| location | Bangalore, India | |
| age | 31 | |
| visits | member for | 1 year, 8 months |
| seen | 2 days ago | |
| stats | profile views | 39 |
Security and Crypto Enthusiast
|
May 2 |
answered | Book Didactic Security Notions |
|
Apr 23 |
comment |
Can we construct fully homomorphic encryption scheme based on non-circuit approach? @ZhigangChen thanks a lot for clarifying the difference, i almost missed it ! |
|
Apr 22 |
comment |
Connections between Instance Hiding and Fully Homomorphic Encryption Eval(y,f) in reality means to f(y) , Eval method is purely coined for definitional purposes, in reality, Bob computes f(y), in both AFK and FHE. To be more clear check the hcrypt project, notice that there is no Eval method the add and multi method only exists hcrypt.com/scarab-library, Eval is purely for definitional issues |
|
Apr 22 |
revised |
Connections between Instance Hiding and Fully Homomorphic Encryption added 63 characters in body |
|
Apr 22 |
comment |
Connections between Instance Hiding and Fully Homomorphic Encryption To answer this please check the question, i have edited it for more clarity. In FHE, too we ultimately build any function from basic functions like add and multi, |
|
Apr 22 |
revised |
Connections between Instance Hiding and Fully Homomorphic Encryption more clarity on the question |
|
Apr 22 |
awarded | Famous Question |
|
Apr 22 |
revised |
Connections between Instance Hiding and Fully Homomorphic Encryption added 293 characters in body; edited title |
|
Apr 22 |
asked | Connections between Instance Hiding and Fully Homomorphic Encryption |
|
Apr 21 |
awarded | Good Question |
|
Apr 21 |
awarded | Notable Question |
|
Apr 21 |
awarded | Nice Question |
|
Apr 20 |
comment |
How to construct encrypted functions (with either public or private data)? A paper "towards mobile cryptography" by Sander, Tschudin has some details on "computing with encrypted functions" |
|
Apr 20 |
comment |
Should I trust CipherCloud? any chances they would kill this thread too ? |
|
Apr 20 |
comment |
Cryptographical formalization of computational privacy @mikeazo , finally i got the paper , search for "secure circuit evaluation" by Abadi, Fiegenbaum , page no 5 , second paragraph, although i did not get it how , let me know if you understand it |
|
Apr 16 |
comment |
How to construct encrypted functions (with either public or private data)? even if the party with decrypting key is involved, how is such computation of encrypted function carried out without decrypting the function ? |
|
Apr 15 |
comment |
Encrypted Functions with Fully Homomorphic Encryption oops forgot to check first before asking , thanks anyway ! |
|
Apr 15 |
asked | Encrypted Functions with Fully Homomorphic Encryption |
|
Mar 23 |
comment |
Security of Deterministic Encryption Scheme thanks would check out those papers, in an imaginary application if the client searches for all the possible words the server has, do you think searchable encryption would have advantage over Deterministic encryption ? |
|
Mar 21 |
comment |
Security of Deterministic Encryption Scheme Yes the message structure should ensure the uniqueness , but what if we don't have much choice there ? what is the best possible thing that can be done if we cannot avoid DE or high entropy ? |
