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.
Professor Gjøsteen has previously worked on electronic voting for the Norwegian government (2009-13), as well as BankID, a Norwegian PKI substitute.
Research interests
- Provable security
- Protocol analysis
- Subgroup membership problems
- Elliptic curves
- Electronic voting
See homepage: http://www.math.ntnu.no/~kristiag/ for more information.
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
- (2018) Security notions for cloud storage and deduplication. Lecture Notes in Computer Science.
- (2017) Malware, Encryption, and Rerandomization - Everything is Under Attack. Lecture Notes in Computer Science. 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. 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. vol. 4964.
- (2008) Weaknesses in BankID, a Norwegian PKI substitute deployed by Norwegian banks. Lecture Notes in Computer Science. vol. 5057.
- (2008) Round-Optimal Blind Signatures from Waters Signatures. Lecture Notes in Computer Science. vol. 5324.
- (2007) A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. Lecture Notes in Computer Science. vol. 4622.
- (2007) Universally Composable Signcryption. Lecture Notes in Computer Science. vol. 4582.
- (2006) A new security proof for Damgard's ElGamal. Lecture Notes in Computer Science. vol. 3860.
- (2005) Homomorphic Cryptosystems Based on Subgroup Membership Problems. Lecture Notes in Computer Science. vol. 3715.
- (2005) Security Notions for Disk Encryption. Lecture Notes in Computer Science. vol. 3679.
- (2005) Spreading Alerts Quietly and the Subgroup Escape Problem. Lecture Notes in Computer Science. vol. 3788.
- (2005) Symmetric Subgroup Membership Problems. Lecture Notes in Computer Science. vol. 3386.
Part of book/report
- (2018) Definitions for Plaintext-Existence Hiding in Cloud Storage. ARES'18. Proceedings of The 13th International Conference on Availability, Reliability and Security - Hamburg, Germany — August 27 - 30, 2018.
- (2017) Side channels in deduplication: trade-offs between leakage and efficiency. Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security.
- (2017) A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability. Financial Cryptography and Data Security -- FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers.