FWIW, this concept is already known and does not require a new standard or proof about social networking or other electronic sites.
A non-spoofable solution is to publish the hash of your publication in any archived newspaper (i.e., in the personal ads in the back). See: http://en.wikipedia.org/wiki/Linked_timestamping Joe On 12/6/2012 3:56 AM, Pars Mutaf wrote: > Another feature: > http://www.flower-standard.org/spoow.html > <http://www.flower-standard.com/spoow.html> > > and the maths behind the flower standard: > > http://www.flower-standard.org/maths.html > > Feedbacks would be appreciated if any. > > Cheers, > Pars > > -- > Pars Mutaf > flower-standard.org <http://flower-standard.org> > _______________________________________________ IEEE Communications Society Tech. Committee on Computer Communications (TCCC) - for discussions on computer networking and communication. [email protected] https://lists.cs.columbia.edu/cucslists/listinfo/tccc
