Again, the properties of hash function guarentees the preimage resistance, in the link. so, if given a hash, its difficult to find a message that has the provided hash. Also, yes.. with some probability. 1/(2^256) -- which is very very very less. (and can be considered to be 0, looking at the amount of data (hashvalues - message) a CPU can store or process. (computing so many hash values)
Also, if we want to find the intersection without knowing the non-intersection keys. this is an approach. if we want to find the intersection without server knowing any client keys at all. third party is the only approach I can think of. --Sravan Reddy On Mon, Jul 9, 2012 at 11:36 AM, Sairam Ravu <ravu...@gmail.com> wrote: > But, the problem is the server may be having some data sets, and he > may hash to get some values, he will compare those with that of the > hash values given by the client. Then, he will come to know the > possible values which the client has sent with some probability > > -- > With love and regards, > Sairam Ravu > I M.Tech(CS) > Sri Sathya Sai Institute of Higher Learning > "To live life, you must think it, measure it, experiment with it, > dance it, paint it, draw it, and calculate it" > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
