Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
For a new project which addresses the problem of secure handling of personal data and privacy in many-core architectures, we proposes a Post Doc position to work on secure-by-design crypto-processor embedded in many-core architecture. We are looking for candidates with an outstanding Ph.D. in computer science or electrical engineering. Strong knowledge in digital system (VHDL, SystemC) design would be appreciated.
The Post-Doc position will start in January 2014, it is funded for 12 month extendable to 36 month.
To apply please send your detailed CV, motivation for applying (1 page) and names of at least two people who can provide reference letters (email).
The group has two faculty members (Ivan Damgard and Jesper Buus Nielsen), 3 postdocs and 8 PhD students. We can offer an active and welcoming research environment with good possibilities for travels and inviting guests. We usually offer 1-year contracts with an option for prolonging by a year.
In this paper, we provide impossibility results on projecting bilinear pairings in a prime-order group setting. More precisely, we specify the lower bounds of
1. the image size of a projecting asymmetric bilinear pairing
2. the image size of a projecting symmetric bilinear pairing
3. the computational cost for a projecting asymmetric bilinear pairing
4. the computational cost for a projecting symmetric bilinear pairing
in a prime-order group setting naturally induced from the $k$-linear assumption, where the computational cost means the number of generic operations.
Our lower bounds regarding a projecting asymmetric bilinear pairing are tight, i.e., it is impossible to construct a more efficient projecting asymmetric bilinear pairing than the constructions of Groth-Sahai and Freeman. However, our lower bounds regarding a projecting symmetric bilinear pairing differ from Groth and Sahai\'s results regarding a symmetric bilinear pairing; We fill these gaps by constructing projecting symmetric bilinear pairings.
In addition, on the basis of the proposed symmetric bilinear pairings, we construct more efficient instantiations of cryptosystems that essentially use the projecting symmetric bilinear pairings in a modular fashion. Example applications include new instantiations of the Boneh-Goh-Nissim cryptosystem, the Groth-Sahai non-interactive proof system, and Seo-Cheon round optimal blind signatures proven secure under the DLIN assumption. These new instantiations are more efficient than the previous ones, which are also provably secure under the DLIN assumption. These applications are of independent interest.
rights over a tag from a current owner to a new owner in a secure
and private way. Recently, Kapoor and Piramuthu have proposed two
schemes which overcome most of the security weaknesses detected in
previously published protocols. Still, this paper reviews that
work and points out that such schemes still present some practical
and security issues. In particular, they do not manage to
guarantee the privacy of the new owner without the presence of a
Trusted Third Party, and we find that the assumed communication
model is not suitable for many practical scenarios. We then
propose here a lightweight protocol that can be used in a wider
range of applications, and which incorporates recently defined
security properties such as Tag Assurance, Undeniable Ownership
Transfer, Current Ownership Proof and Owner Initiation. Finally,
this protocol is complemented with a proposed Key Change Protocol,
based on noisy tags, which provides privacy to the new owner
without either resorting to a Trusted Third Party or assuming an
Keywords: Computationally perfect, Ideal, Secret sharing scheme, Conjunctive hierarchical access structure, Disjunctive hierarchical access structure, MDS code.
Our results on ARIA-192/256 are the first known DFA results on them.
all abelian varieties the usual Miller\'s algorithm to compute a
function associated to a principal divisor. We also explain how to
use the Frobenius morphism on abelian varieties defined over a
finite field in order to shorten the loop of the Weil and Tate
pairings algorithms. This extend preceding results about ate and
twisted ate pairings to all abelian varieties. Then building upon
the two preceding ingredients, we obtain a variant of optimal
pairings on abelian varieties. Finally, by introducing new addition
formulas, we explain how to compute optimal pairings on Kummer
varieties. We compare in term of performance the resulting
algorithms to the algorithms already known in the genus one and two