Can we construct unbounded time-stamping schemes from collision-free hash functions?

dc.contributor.advisor	Buldas, Ahto, juhendaja
dc.contributor.author	Niitsoo, Margus
dc.contributor.other	Tartu Ülikool. Loodus- ja täppisteaduste valdkond	et
dc.contributor.other	Tartu Ülikool. Arvutiteaduse instituut	et
dc.date.accessioned	2021-01-29T11:29:20Z
dc.date.available	2021-01-29T11:29:20Z
dc.date.issued	2008
dc.description.uri	https://www.ester.ee/record=b5350950*est	et
dc.identifier.other	ARH Diss. B-17344
dc.identifier.uri	http://hdl.handle.net/10062/71186
dc.language.iso	eng	et
dc.publisher	Tartu Ülikool	et
dc.rights	restrictedAccess	et
dc.subject.other	magistritööd	et
dc.subject.other	informaatika	et
dc.subject.other	infotehnoloogia	et
dc.subject.other	informatics	et
dc.subject.other	infotechnology	et
dc.subject.other	krüptograafia	et
dc.subject.other	ajatembeldussüsteemid	et
dc.subject.other	andmekaitse	et
dc.subject.other	arvutiturve	et
dc.title	Can we construct unbounded time-stamping schemes from collision-free hash functions?	et
dc.type	Thesis	et

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1