Kristian Gjøsteen
Background and activities
Kristian Gjøsteen is a professor at the Department of Mathematical Sciences. He has a MSc and a PhD from NTNU. He belongs to the Algebra Group.
Gjøsteen's research interests include cryptographic voting systems, key exchange protocols, cloud cryptography, formal methods applied to security proofs and privacy. Publication list.
Gjøsteen was a member of the Norwegian Government’s Committee of Digital Vulnerabilities in Society (Lysne-utvalget). He has worked on electronic voting for the Norwegian government (2009-13), as well as electronic identification in Norway.
Scientific, academic and artistic work
A selection of recent journal publications, artistic productions, books, including book and report excerpts. See all publications in the database
Journal publications
- (2020) Fast and Secure Updatable Encryption. Lecture Notes in Computer Science (LNCS). vol. 12170 LNCS.
- (2020) Cloud-assisted Asynchronous Key Transport with Post-Quantum Security. Lecture Notes in Computer Science (LNCS). vol. 12248 LNCS.
- (2019) A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks. Lecture Notes in Computer Science (LNCS). vol. 11898.
- (2019) Highly Efficient Key Exchange Protocols with Optimal Tightness. Lecture Notes in Computer Science (LNCS). vol. 11694 LNCS.
- (2018) Offline Assisted Group Key Exchange. Lecture Notes in Computer Science (LNCS). vol. 11060 LNCS.
- (2018) Security notions for cloud storage and deduplication. Lecture Notes in Computer Science (LNCS). vol. 11192 LNCS.
- (2018) Practical and tightly-secure digital signatures and authenticated key exchange. Lecture Notes in Computer Science (LNCS). vol. 10992 LNCS.
- (2017) Malware, Encryption, and Rerandomization - Everything is Under Attack. Lecture Notes in Computer Science (LNCS). vol. 10311.
- (2016) Using Cryptography to Control Your Data at a Distance. ERCIM News. vol. 106.
- (2016) An experiment on the security of the Norwegian electronic voting protocol. Annales des télécommunications.
- (2014) Spreading Alerts Quietly and the Subgroup Escape Problem. Journal of Cryptology. vol. 28 (4).
- (2011) A Novel Framework for Protocol Analysis. Lecture Notes in Computer Science (LNCS). vol. 6980.
- (2008) A framework for compositional verification of security protocols. Information and Computation. vol. 206 (2-4).
- (2008) A Latency-Free Election Scheme. Lecture Notes in Computer Science (LNCS). vol. 4964.
- (2008) Weaknesses in BankID, a Norwegian PKI substitute deployed by Norwegian banks. Lecture Notes in Computer Science (LNCS). vol. 5057.
- (2008) Round-Optimal Blind Signatures from Waters Signatures. Lecture Notes in Computer Science (LNCS). vol. 5324.
- (2007) A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. Lecture Notes in Computer Science (LNCS). vol. 4622.
- (2007) Universally Composable Signcryption. Lecture Notes in Computer Science (LNCS). vol. 4582.
- (2006) A new security proof for Damgard's ElGamal. Lecture Notes in Computer Science (LNCS). vol. 3860.
- (2005) Homomorphic Cryptosystems Based on Subgroup Membership Problems. Lecture Notes in Computer Science (LNCS). vol. 3715.