Data Privacy Management and Autonomous Spontaneous Security
7th International Workshop, DPM 2012, and 5th International Workshop, SETOP 2012, Pisa, Italy, September 13-14, 2012. Revised Selected Papers
Chapter and Conference Paper
In this work, we investigate if two essential properties in electronic voting, coercion-resistance and cast-as-intended verifiability, can be jointly achieved in settings where voters are (very) limited from a...
Chapter and Conference Paper
Interactive zero-knowledge systems are a very important cryptographic primitive, used in many applications, especially when deniability (also known as non-transferability) is desired. In the lattice-based sett...
Chapter and Conference Paper
We consider the problem of achieving, at the same time, cast-as-intended verifiability and coercion resistance, in remote electronic voting systems where there are no secure channels through which voters can r...
Chapter and Conference Paper
In an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes. Each node of the network re-encrypts the input list of ciphertexts and randomly permutes it in a process na...
Chapter and Conference Paper
Re-randomizable RCCA-secure public key encryption (Rand-RCCA PKE) schemes reconcile the property of re-randomizability of the ciphertexts with the need of security against chosen-ciphertexts attacks. In this p...
Article
The current serotonin-based biological model of suicidal behavior (SB) may be too simplistic. There is emerging evidence that other biomarkers and biological systems may be involved in SB pathophysiology. The ...
Chapter and Conference Paper
We consider access structures over a set \(\mathcal {P}\) of n participants, defined by a parameter k with
Article
Goldwasser and Micali (J Comput Syst Sci 28(2):270–299, 1984) highlighted the importance of randomizing the plaintext for public-key encryption and introduced the notion of semantic security. They also realized a...
Article
We design in this paper the first attribute-based cryptosystems that work in the classical discrete logarithm, pairing-free, setting. The attribute-based signature scheme can be seen as an extension of Schnorr...
Chapter and Conference Paper
In electronic voting, we say that a protocol has cast-as-intended verifiability if the contents of each encrypted vote can be audited in order to ensure that they match the voter’s selections. It is traditiona...
Article
In a multi-secret sharing scheme (MSSS), \(\ell \) ...
Article
Let us consider the following situation: \(t\) t ...
Article
The goal of a signcryption scheme is to achieve the same functionalities as encryption and signature together, but in a more efficient way than encrypting and signing separately. To increase security and relia...
Chapter and Conference Paper
Lossy trapdoor functions, introduced by Peikert and Waters (STOC’08), have received a lot of attention in the last years, because of their wide range of applications. The notion has been recently extended to t...
Book and Conference Proceedings
7th International Workshop, DPM 2012, and 5th International Workshop, SETOP 2012, Pisa, Italy, September 13-14, 2012. Revised Selected Papers
Chapter and Conference Paper
Attribute-based cryptography is a natural solution for fine-grained access control with respect to security policies. In the case of attribute-based signatures (ABS), users obtain from an authority their secre...
Chapter and Conference Paper
We introduce the concept of identity-based encryption (IBE) with master key-dependent chosen-plaintext (mKDM-sID-CPA) security. These are IBE schemes that remain secure even after the adversary sees encryption...
Chapter and Conference Paper
An attribute-based signature with respect to a signing policy, chosen ad-hoc by the signer, convinces the verifier that the signer holds a subset of attributes satisfying that signing policy. The verifier must...
Article
We investigate proxy auctions, an auction model which is proving very successful for on-line businesses (e.g., http://www.ebay.com), where a trusted server m...
Article
In secret sharing schemes a secret is distributed among a set of users \({\mathcal{P}}\) in such a way that only some...