But again.. this can be reconstructed at the sever. taking first number and
adding the differences.
On Monday, 9 July 2012 23:54:23 UTC-4, enchantress wrote:
Give the first first number and set of cosecutive diffrence.
On Sunday, 8 July 2012 10:55:55 UTC+5:30, Sairam wrote:
How do you
Properties of cryptographic hash functions will help.
so, sending a hash of a value is the best option.
as its nearly impossible to find a value for a given hash.
http://en.wikipedia.org/wiki/Cryptographic_hash_function#Properties
both server and client using same hash function will solve this.
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,
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
Give the first first number and set of cosecutive diffrence.
On Sunday, 8 July 2012 10:55:55 UTC+5:30, Sairam wrote:
How do you find the intersection of two sets in a secured way?
Which means imagine a situation where there is a client who has got a set
S1={1,2,3}, and there is a server
