Date of Award

1-1-2012

Language

English

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

College/School/Department

Department of Computer Science

Content Description

1 online resource (x, 68 pages) : illustrations.

Dissertation/Thesis Chair

Paliath Narendran

Committee Members

Neil V Murray, Santiago Escobar

Keywords

Blind Signatures, Cryptographic Protocols, Decidability, Equational Unification, Formal Verification, Digital signatures, Data encryption (Computer science), Computer security, Cryptography, Computer science

Subject Categories

Computer Sciences

Abstract

This thesis is concerned with equational unification problems that are relevant in formal verification of cryptographic protocols which deploy blind signature schemes. Blind signatures are signature schemes that keep the content confidential and have applications in modern cryptography for electronic voting and digital cash schemes. Equational unification problems studied here originate from blind RSA signatures and El Gamal encryption.

Share

COinS