Kristian Gjøsteen

Orcid: 0000-0001-7317-8625

According to our database1, Kristian Gjøsteen authored at least 62 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Depth Optimized Circuits for Lattice Based Voting with Large Candidate Sets.
IACR Cryptol. ePrint Arch., 2024

Password-authenticated Key Exchange and Applications.
IACR Cryptol. ePrint Arch., 2024

2023
Machine-checked proofs of privacy against malicious boards for Selene & Co.
J. Comput. Secur., 2023

Coercion Mitigation for Voting Systems with Trackers: A Selene Case Study.
IACR Cryptol. ePrint Arch., 2023

On Optimal Tightness for Key Exchange with Full Forward Secrecy via Key Confirmation.
IACR Cryptol. ePrint Arch., 2023

Security Model for Privacy-Preserving Blockchain-Based Cryptocurrency Systems.
Proceedings of the Network and System Security - 17th International Conference, 2023

Hybrid Group Key Exchange with Application to Constrained Networks.
Proceedings of the Information Security - 26th International Conference, 2023

Machine-Checked Proofs of Accountability: How to sElect Who is to Blame.
Proceedings of the Computer Security - ESORICS 2023, 2023

Modeling Noise-Accepting Key Exchange.
Proceedings of the Code-Based Cryptography - 11th International Workshop, 2023

2022
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions.
IACR Cryptol. ePrint Arch., 2022

PriBank: Confidential Blockchain Scaling Using Short Commit-and-Proof NIZK Argument.
Proceedings of the Topics in Cryptology - CT-RSA 2022, 2022

2021
Verifiable Decryption in the Head.
IACR Cryptol. ePrint Arch., 2021

Lattice-Based Proof of Shuffle and Applications to Electronic Voting.
IACR Cryptol. ePrint Arch., 2021

Towards Verifiable Remote Voting with Paper Assurance.
CoRR, 2021

2020
Practical Isogeny-Based Key-exchange with Optimal Tightness.
IACR Cryptol. ePrint Arch., 2020

Efficient mixing of arbitrary ballots with everlasting privacy: How to verifiably mix the PPATC scheme.
IACR Cryptol. ePrint Arch., 2020

Revisiting Practical and Usable Coercion-Resistant Remote E-Voting.
Proceedings of the Electronic Voting - 5th International Joint Conference, 2020

Fast and Secure Updatable Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

A Blockchain Model in Tamarin and Formal Analysis of Hash Time Lock Contract.
Proceedings of the 2nd Workshop on Formal Methods for Blockchains, 2020

2019
Subliminal channels in post-quantum digital signature schemes.
IACR Cryptol. ePrint Arch., 2019

Cloud-assisted Asynchronous Key Transport with Post-Quantum Security.
IACR Cryptol. ePrint Arch., 2019

Highly Efficient Key Exchange Protocols with Optimal Tightness - Enabling real-world deployments with theoretically sound parameters.
IACR Cryptol. ePrint Arch., 2019

RISE and SHINE: Fast and Secure Updatable Encryption.
IACR Cryptol. ePrint Arch., 2019

Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme.
CoRR, 2019

A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Highly Efficient Key Exchange Protocols with Optimal Tightness.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2018

Zero-Knowledge Proof of Decryption for FHE Ciphertexts.
IACR Cryptol. ePrint Arch., 2018

Definitions for Plaintext-Existence Hiding in Cloud Storage.
IACR Cryptol. ePrint Arch., 2018

Offline Assisted Group Key Exchange.
IACR Cryptol. ePrint Arch., 2018

Adversaries monitoring Tor traffic crossing their jurisdictional border and reconstructing Tor circuits.
CoRR, 2018

On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields.
CoRR, 2018

2017
A roadmap to fully homomorphic elections: Stronger security, better verifiability.
IACR Cryptol. ePrint Arch., 2017

Malware encryption schemes - rerandomizable ciphertexts encrypted using environmental keys.
IACR Cryptol. ePrint Arch., 2017

Security notions for cloud storage and deduplication.
IACR Cryptol. ePrint Arch., 2017

2016
Fully homomorphic encryption must be fat or ugly?
IACR Cryptol. ePrint Arch., 2016

Side channels in deduplication: trade-offs between leakage and efficiency.
IACR Cryptol. ePrint Arch., 2016

Using Cryptography to Control Your Data at a Distance.
ERCIM News, 2016

An experiment on the security of the Norwegian electronic voting protocol.
Ann. des Télécommunications, 2016

Malware, Encryption, and Rerandomization - Everything Is Under Attack.
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

2015
Spreading Alerts Quietly and the Subgroup Escape Problem.
J. Cryptol., 2015

The Norwegian Internet Voting Protocol: A new Instantiation.
IACR Cryptol. ePrint Arch., 2015

A Guide to Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2015

2013
The Norwegian Internet Voting Protocol.
IACR Cryptol. ePrint Arch., 2013

Partially blind password-based signatures using elliptic curves.
IACR Cryptol. ePrint Arch., 2013

Protocol Variants and Electronic Identification.
IACR Cryptol. ePrint Arch., 2013

Towards Privacy Preserving Mobile Internet Communications - How Close Can We Get?
Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2011
A Novel Framework for Protocol Analysis.
J. Internet Serv. Inf. Secur., 2011

Password-Based Signatures.
Proceedings of the Public Key Infrastructures, Services and Applications, 2011

2010
Analysis of an internet voting protocol.
IACR Cryptol. ePrint Arch., 2010

2008
A framework for compositional verification of security protocols.
Inf. Comput., 2008

Round-Optimal Blind Signatures from Waters Signatures.
Proceedings of the Provable Security, Second International Conference, 2008

Weaknesses in BankID, a PKI-Substitute Deployed by Norwegian Banks.
Proceedings of the Public Key Infrastructure, 2008

2007
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.
IACR Cryptol. ePrint Arch., 2007

Universally Composable Signcryption.
Proceedings of the Public Key Infrastructure, 2007

2006
A Latency-Free Election Scheme.
IACR Cryptol. ePrint Arch., 2006

Universally Composable Blind Signatures in the Plain Model.
IACR Cryptol. ePrint Arch., 2006

2005
Security notions for disk encryption.
IACR Cryptol. ePrint Arch., 2005

Symmetric Subgroup Membership Problems.
Proceedings of the Public Key Cryptography, 2005

Homomorphic Cryptosystems Based on Subgroup Membership Problems.
Proceedings of the Progress in Cryptology, 2005

2004
A new security proof for Damgård's ElGamal.
IACR Cryptol. ePrint Arch., 2004

2003
Homomorphic public-key systems based on subgroup membership problems.
IACR Cryptol. ePrint Arch., 2003


  Loading...