Description
Digital signatures were introduced to guarantee the authenticity and integrity of the underlying messages. However, and in situations where the signed data is commercially or personally sensitive, the universal verification of digital signatures is undesirable, and needs to be limited or controlled. Therefore, mechanisms which share most properties with digital signatures except the universal verification were invented to respond to the aforementioned need; we call such mechanisms ``opaque signatures''. In this talk, we study confirmer signatures where the verification cannot be achieved without the cooperation of a specific entity, i.e. the confirmer, via the so-called confirmation/denial protocols. Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt the resulting signature, or produce a commitment on the message, encrypt the string used to generate the commitment, and finally sign the latter. In this talk, we revisit both methods and establish the minimal and sufficient assumptions on the building blocks in order to attain secure confirmer signatures. Our study concludes that both paradigms, when used in their basic form, cannot allow a class of encryption schemes which is vital for the efficiency of the confirmation/denial protocols. Next, we propose a variation of both paradigms which thrives on very cheap encryption and consequently leads to efficient confirmer signatures. Indeed, the resulting constructions do not only compete with the dedicated realizations of confirmer/undeniable signatures proposed recently, e.g. \citep{LeTrieuKurosawaOgata2009b,SchuldtMatsuura2010}, but also serve for analyzing the early schemes that have a speculative security.<br/> The contents of this talk are parts of the speaker's PhD thesis.
Next sessions
-
Verification of Rust Cryptographic Implementations with Aeneas
Speaker : Aymeric Fromherz - Inria
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…] -
On the average hardness of SIVP for module lattices of fixed rank
Speaker : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-