Jelizaveta Vakarjuk

dblp:302/4282 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0001-6398-3663ORCID · verified

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

Security and privacy · 4 · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Coppercloud: Blind Server-Supported RSA Signatures
Nikita Snetkov, Jelizaveta Vakarjuk, Alisa Pankova
SECRYPT (1)2
2025 Privacy-Preserving Server-Supported Decryption
abstract
In this paper, we consider encryption systems with two-out-of-two threshold decryption, where one of the parties (the client) initiates the decryption and the other one (the server) assists. Existing threshold decryption schemes disclose to the server the ciphertext that is being decrypted. We give a construction, where the identity of the ciphertext is not leaked to the server, and the client's privacy is thus preserved. While showing the security of this construction, we run into the issue of defining the security of a scheme with blindly assisted decryption. We discuss previously proposed security definitions for similar cryptographic functionalities and argue why they do not capture the expected meaning of security. We propose an ideal functionality for the encryption with server-supported blind threshold decryption in the universal composability model, carefully balancing between the meaning of privacy, and the ability to implement it. We construct a protocol and show that it is a secure implementation of the proposed functionality in the random oracle model.
Peeter Laud, Alisa Pankova, Jelizaveta Vakarjuk
CSF3
2025 Electrum: UC Fail-Stop Server-Supported Signatures
Nikita Snetkov, Jelizaveta Vakarjuk, Peeter Laud
ProvSec2
2024 TOPCOAT: towards practical two-party Crystals-Dilithium
abstract
Abstract The development of threshold protocols based on lattice-signature schemes has been of increasing interest in the past several years. The main research focus has been towards protocols constructed for various variants of Crystals-Dilithium, future NIST digital signature standard known as ML-DSA. In this work, we propose TOPCOAT, a two-party lattice-based signature algorithm that embodies Dilithium’s compression techniques. The aforesaid result is achieved by introducing a new hinting mechanism that allows parties to collaboratively calculate $$\textsf {HighBits}$$ HighBits . Our hinting mechanism allows public key compression similar to Dilithium. Additionally, we suggest an optimization technique to minimize number of restarts both parties need to produce a valid signature. Our approach allows to produce $$\approx 10$$ ≈ 10 KB signatures within 3 rounds of communication. We prove security of our scheme under MLWE and MSIS assumptions in ROM, and provide implementation of our proposed scheme. As additional contribution, we present vulnerabilities and inconsistencies found in Liu et al. work (Future Generation Computer Systems 2023) which aimed to construct distributed lattice-based signature protocol.
Nikita Snetkov, Jelizaveta Vakarjuk, Peeter Laud
Discov. Comput.2
2023 CACS: A Cloud Privacy-Preserving Attribute Management System
abstract
We present Centralized Attribute Collection Service (CACS), a system for storing credentials in the cloud, with satisfying privacy properties for users, and additional assurances for relying parties. The system deploys privacy-enhancing technologies to protect users’ identities and credentials presented to relying parties. At the same time, the system can vouch for the trustfulness of issuers to relying parties. The system also allows users to obtain the access logs for their credentials, enabling them to compare them against their usage. The presentation of credentials to relying parties follows the standard protocols of Mobile Driving Licence (mDL, ISO 18013-5).
Aivo Kalu, Burak Can Kus, Peeter Laud, Kin Long Leung, Nikita Snetkov, Jelizaveta Vakarjuk
ARES6