Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/7093
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJha, Ashwin-
dc.date.accessioned2020-12-21T10:29:06Z-
dc.date.available2020-12-21T10:29:06Z-
dc.date.issued2019-10-
dc.identifier.citation227p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/7093-
dc.descriptionThesis is under the supervision of Prof. Mridul Nandien_US
dc.description.abstractAbstract: A symmetric-key cryptographic scheme is deemed to be provably secure if one can formally argue that it is secure given the hardness of some underlying computational problem. This thesis is a study of the provable security of symmetric-key cryptographic schemes, encompassing major information security goals, viz. data authentication, encryption and authenticated encryption. Along the way, we provide quantitative (better security bounds) and/or qualitative (relaxation in security preconditions) improvements in the provable security of several schemes. Among authentication schemes, we study CBC-MAC and XMAC family of message authentication codes. In case of the CBC-MAC family, we provide improved security bounds for several members, and in case of the XMAC family, we generalize the underlying counter-based encoding to derive simplified security arguments and several efficient variants. Among encryption schemes, we explore possible ways to construct beyond-the-birthday bound online ciphers using tweakable block ciphers. We show that an existing BBB scheme POEx is only birthday bound secure, and as a consequence propose a variant called XTC that achieves (almost) optimal security. On a related topic, we study the security of CLRW2, a tweakable block cipher construction based on block ciphers. We show tight security for CLRW2 under the assumption that the underlying hash functions are 3-wise AXU hash. We conclude our study with an exploration of the scope of random read access in OCB authentication encryption scheme. We observe that the existing versions of OCB are highly inefficient in random read access due to a strong assumption (AXU hash) on the underlying mask generating function. We define a relaxed notion of universal hash, called locally imperfect XOR universal (LIXU), and show that generalized OCB is secure even under this relaxed notion. Finally, we give some efficient candidates for LIXU hash that are apt for efficient random read access in OCB.en_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesISI, Ph. D Thesis;TH470-
dc.subjectSymmetric-key cryptographyen_US
dc.subjectProvable Securityen_US
dc.subjectCBC-MACen_US
dc.subjectCascaded LRW2en_US
dc.titleProvable Security of Symmetric-keyCryptographic Schemesen_US
dc.typeThesisen_US
Appears in Collections:Theses

Files in This Item:
File Description SizeFormat 
ashwin_jha-phd_thesis.pdf1.43 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.