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

dc.contributor.advisorBuldas, Ahto, juhendaja
dc.contributor.authorNiitsoo, Margus
dc.contributor.otherTartu Ülikool. Loodus- ja täppisteaduste valdkondet
dc.contributor.otherTartu Ülikool. Arvutiteaduse instituutet
dc.date.accessioned2021-01-29T11:29:20Z
dc.date.available2021-01-29T11:29:20Z
dc.date.issued2008
dc.description.urihttps://www.ester.ee/record=b5350950*estet
dc.identifier.otherARH Diss. B-17344
dc.identifier.urihttp://hdl.handle.net/10062/71186
dc.language.isoenget
dc.publisherTartu Ülikoolet
dc.rightsrestrictedAccesset
dc.subject.othermagistritöödet
dc.subject.otherinformaatikaet
dc.subject.otherinfotehnoloogiaet
dc.subject.otherinformaticset
dc.subject.otherinfotechnologyet
dc.subject.otherkrüptograafiaet
dc.subject.otherajatembeldussüsteemidet
dc.subject.otherandmekaitseet
dc.subject.otherarvutiturveet
dc.titleCan we construct unbounded time-stamping schemes from collision-free hash functions?et
dc.typeThesiset

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
niitsoo_mag.pdf
Size:
267.28 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.67 KB
Format:
Item-specific license agreed upon to submission
Description: