Abstract
dc:descriptionLattice-based cryptography began with the groundbreaking work of M. Ajtai [14] back in the 90's and has since then proven to be one of the most versatile approaches for constructing provably secure, efficient, and highly parallelizable cryptographic primitives that can withstand attacks even by quantum computers. Moreover, lattice-based cryptography offers the unique feature of allowing for worst-case to average-case reductions, which is needed for cryptographic applications because the mere existence of a computationally hard problem instance in the worst case guarantees security inthe average case. This not only allows us to harness the hardness of worst-case lattice problems, but it also typically simplifies key selection.While some of the more ubiquitous cryptographic primitives like digital signatures have been extensively explored during the past two decades, far less progress has been made with more advanced primitives which possess additional features, despite their significance in a plethora of real-world privacy-preserving applications like e-cash, e-voting, e-auctions, blindly signed contracts (used in cryptocurrencies), wireless sensor networks, and anonymous credentials (used in Microsoft's U-Prove technology).Motivated by this relative dearth of results, as well as the diverse and exemplary spectrum of application scenarios, this dissertation aims on not only enabling such privacy-friendly applications from lattice assumptions, but also making them both practical, and efficient. We believe that our techniques can be transferred to other application scenarios as well.
Degree
thesis:*- Grantor dc:publisher
- Πανεπιστήμιο Μακεδονίας
- Year dc:date
- 2022
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Papachristoudis, Dimitrios
- Παπαχρηστούδης, Δημήτριος
Subjects
dc:subject × 22- Κρυπτογραφία βασισµένη στα δικτυώµατα
- Μετακβαντική κρυπτογραφία
- Εφαρµογές προσανατολισµένες στην ιδιωτικότητα
- Τυφλές υπογραφές
- Ευαπόδεικτη ασφάλεια
- Υπογραφές πληρεξουσίου
- Lattice-based cryptography
- Post-quantum cryptography
- Privacy-oriented applications
- Blind signatures
- Provable security
- Proxy signatures
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Φυσικές Επιστήμες
- Διεπιστημονικές εφαρμογές επιστήμης ηλεκτρονικών υπολογιστών
- Μαθηματικά
- Εφαρμοσμένα μαθηματικά
- Computer and Information Sciences
- Natural Sciences
- Computer Science Interdisciplinary Applications
- Mathematics
- Applied Mathematics
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/51533