Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Two topics in cryptography: lattice problems and the security of protocols
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
2005 (English)Licentiate thesis, monograph (Other scientific)
Abstract [en]

In this thesis we present new results in two areas – cryptographic protocols and lattice problems.

• We present a new protocol for electronic cash which is designed to function on hardware with limited computing power. The scheme has provable security properties and low computational requirements, but it still gives a fair amount of privacy. Another feature of the system is that there is no master secret that could be used for counterfeiting money if stolen.

• We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the signers as leaves. For a signer that is a leaf of the subtree of a group manager, the group manager learns which of its children that (perhaps indirectly) manages the signer. We provide definitions for the new notion and construct a scheme that is provably secure given the existence of a family of trapdoor permutations. We also present a construction which is relatively practical, and prove its security in the random oracle model under the strong RSA assumption and the DDH assumption.

• We show a weakness in the specification for offline capable EMV payment cards. The weakness, which applies to cards without RSA capability, enables an attacker to duplicate a card and make transactions that cannot be tied to the original card.

• We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn/Λ has n - 1 cycles of equal length with arbitrary precision. We also show that a direct consequence of this is that the Shortest Vector Problem and the Closest Vector Problem cannot be easier for this type of lattices than for general lattices.

Place, publisher, year, edition, pages
Stockholm: KTH , 2005. , x, 129 p.
Series
Trita-NA, ISSN 0348-2952 ; 0504
Keyword [en]
Datalogi
Keyword [sv]
Datalogi
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-151ISBN: 91-7283-965-1 (print)OAI: oai:DiVA.org:kth-151DiVA: diva2:7412
Presentation
2005-03-11, Sal E2, Lindstedtsvägen 3, Stockholm, 10:00
Supervisors
Note
QC 20101222Available from: 2005-03-16 Created: 2005-03-16 Last updated: 2010-12-22Bibliographically approved

Open Access in DiVA

fulltext(1279 kB)1361 downloads
File information
File name FULLTEXT01.pdfFile size 1279 kBChecksum MD5
18635fa3a4ee592f69a27301ee8e0b2bc7bfba23f2e87a1584cf170a00dafa1d7cd05106
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Trolin, Mårten
By organisation
Numerical Analysis and Computer Science, NADA
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1361 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 697 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf