sashank

689 reputation

1313

bio	website
	location	Bangalore, India
	age	31
visits	member for	1 year, 8 months
	seen	yesterday
stats	profile views	39

Security and Crypto Enthusiast

	689 reputation	bio	website		visits	member for	1 year, 8 months
1313 badges		location	Bangalore, India		seen	yesterday

summary answers questions tags badges favorites bounties reputation activity

69 Comments

suggestions reviews revisions comments badges posts accepts all

Jun 11	comment	Can any one explain Circuit Privacy using fully homomorphic encryption from Gentry's thesis? the transformation is tough, i have edited the question thanks anyway
May 31	comment	can we do double encryption of a message without first key? @thomas, i see your point , the encryption points should not derive $k_1$ so i rule out the approach 1 in my question. the points have only encryptions of $k_1$ but i want data to be encrypted with $k_1$ without decrypting it . may sound stupid but this is what am looking for
May 31	comment	can we do double encryption of a message without first key? double decryption wont work if $k_2$ is encryption of $k_1$
May 31	comment	can we do double encryption of a message without first key? you mean same encryption scheme ? not necessarily
May 26	comment	sir,please suggest me an algorithm or method how can i improve the prediction based encryption method using randomization? yeah homework packaged as a question here , @rashmi, do some ground work before asking anything
May 16	comment	Is Functional Encryption about Access Control over encrypted data alone? in a way you are correct, prima facie there aren't any connections. but if we dig deeper, both allow some kind of function evaluation over encrypted data which is key, FE does not give output privacy where as FHE gives that is difference, if we find connections may be we can find better FHE solutions , because there are successful methods already in FE
May 16	comment	Is Functional Encryption about Access Control over encrypted data alone? search for a paper " on connections between FE and FHE".
May 16	comment	Is Functional Encryption about Access Control over encrypted data alone? in a way yes , am mixing it with FHE , as there are possible connections
May 11	comment	How to do a literature search This may be made a generic question and moved to academic.se ? for greater good ?
May 9	comment	What kind of adversary is the cloud? not it is not silly, you never know , how much google/amazon are making of use of customers data for monetizing etc, if not attack their own customers, even this would be threat for a customer
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	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 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 !
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 ?