Learn More
Homomorphic signatures are primitives that allow for public computations on authenticated data. At TCC 2012, Ahn et al. defined a framework and security notions for such systems. For a predicate P , their notion of P-homomorphic signature makes it possible, given signatures on a message set M , to publicly derive a signature on any message m such that P (M,(More)
In this study we show in mice that Ftm (Rpgrip1l) is located at the ciliary basal body. Our data reveal that Ftm is necessary for developmental processes such as the establishment of left-right asymmetry and patterning of the neural tube and the limbs. The loss of Ftm affects the ratio of Gli3 activator to Gli3 repressor, suggesting an involvement of Ftm in(More)
Structure-preserving signatures (SPS) are signature schemes where messages, signatures and public keys all consist of elements of a group over which a bilinear map is efficiently computable. This property makes them useful in cryptographic protocols as they nicely compose with other algebraic tools (like the celebrated Groth-Sahai proof systems). In this(More)
To gain strong confidence in the security of a public-key scheme, it is most desirable for the security proof to feature a tight reduction between the adversary and the algorithm solving the underlying hard problem. Recently, Chen and Wee (Crypto '13) described the first Identity-Based Encryption scheme with almost tight security under a standard(More)
Several independent, genome-wide association studies have identified a strong correlation between body mass index and polymorphisms in the human FTO gene. Common variants in the first intron define a risk allele predisposing to obesity, with homozygotes for the risk allele weighing approximately 3 kilograms more than homozygotes for the low risk allele.(More)
Group signatures are a central cryptographic primitive where users can anonymously and accountably sign messages in the name of a group they belong to. Several efficient constructions with security proofs in the standard model (i.e., without the random oracle idealization) appeared in the recent years. However, like standard PKIs, group signatures need an(More)
Homomorphic signatures are primitives that allow for public computations for a class of specified predicates over authenticated data. An enhanced privacy notion, called complete context-hiding security , was recently motivated by Attrapadung et al. (Asiacrypt'12). This notion ensures that a signature derived from any valid signatures is perfectly(More)
Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most efficient in constructing non-interactive witness indistinguishable and zero-knowledge proofs for algebraic relations. For the important task of proving(More)
We propose a new encryption primitive, commitment consistent encryption (CCE), and instances of this primitive that enable building the first universally verifiable voting schemes with a perfectly private audit trail (PPAT) and practical complexity. That is: – the audit trail that is published for verifying elections guarantees everlasting privacy, and –(More)