Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tjerand Silde

dblp:289/2148 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2024
0000-0002-5455-0409ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 83% Cryptographic primitives and cryptanalysis · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › threshold cryptography
distributed decryption
0.712023
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions · CCS 2023
Cryptographic protocols and secure computation
electronic voting
0.712023
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions · CCS 2023
Cryptographic protocols and secure computation › electronic voting
verifiable mix nets
0.712023
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions · CCS 2023
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.212023
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions · CCS 2023
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.212023
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions · CCS 2023

Methods — techniques the papers use, named apart from their topics

zero-knowledge proofs · 0.7lattice-based cryptography · 0.7
YearPublicationVenuePosition
2024 Two-Round Threshold Lattice-Based Signatures from Threshold Homomorphic Encryption
Kamil Doruk Gür, Jonathan Katz, Tjerand Silde
PQCrypto (2)3
2023 Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions
abstract
Cryptographic voting protocols have recently seen much interest from practitioners due to their (planned) use in countries such as Estonia, Switzerland, France, and Australia. Practical protocols usually rely on tested designs such as the mixing-and-decryption paradigm. There, multiple servers verifiably shuffle encrypted ballots, which are then decrypted in a distributed manner. While several efficient protocols implementing this paradigm exist from discrete log-type assumptions, the situation is less clear for post-quantum alternatives such as lattices. This is because the design ideas of the discrete log-based voting protocols do not carry over easily to the lattice setting, due to specific problems such as noise growth and approximate relations.
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde
CCS4
2022 Verifiable Decryption in the Head
Kristian Gjøsteen, Thomas Haines, Johannes Müller 0001, Peter B. Rønne, Tjerand Silde
ACISP5
2021 Lattice-Based Proof of Shuffle and Applications to Electronic Voting
Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge
CT-RSA4