Research Area: Information security

Tenured staff

Stig F. Mjølsnes (research area coordinator)

Position: Professor
Research activities: Cryptology and communication security, digital forensics

  • Crypto-protocols. Cryptographic Protocols can be considered as distributed algorithms that employ cryptographic functions for securing distributed computerized communication systems. Their computational multiparty goals are to restrict, establish and preserve information (security properties) robust against intentional modifications to the protocol rules. A specific long-standing inquiry in the field of crypto-protocols is that of defining and constructing information privacy, for instance in digital cash and e-voting schemes.
  • Digital tracks. Our research activity Digital Tracks have applications to both privacy and forensic concerns.

Read more....


Colin Boyd

Position: Professor
Website


Danilo Gligoroski

Position: Professor
Research activities: Cryptology and communication security, access control, cryptographic error-correcting codes
Website

  • Protocols for secure authentication, secure management of digitally produced documents (in their pure digital version or in their human-readable i.e. paper format), keeping personal ID or other personal data in non-disclosed but error-resistant form and other forms for secure declaration of commitments.
  • Security aspects of modern most popular operating systems (such as Windows XP SP2, Windows Server 2003 and Windows Vista).
  • We are developing ultra fast public key schemas for encryption/decryption and for digital signatures. For the first time in the modern cryptography and information security, these schemas are as fast as symmetric cryptographic algorithms. These ultra fast public key schemas are implemented in software and hardware.
  • Hardware and software stream ciphers that are resistant on certain forms of side-channel attacks.
  • Design of cryptographic hash functions and other one-way functions.
  • Development of error-correcting codes that at the same time are random, cryptographically strong, that approach the Shannon limit, and have linear or polynomial decoding time i.e. promotion of a new paradigm: Cryptcoding - Cryptographic Error-Correcting Primitives. Using of those Cryptographic Error-Correcting Primitives in building both secure and error resilient algorithms for wired and wireless communications, especially for multimedia applications.