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.
respect to adversaries with auxiliary input is false in any group where computing discrete logarithms is intractable. The proof uses the \"punctured programs\" technique of [Sahai-Waters 2013].
- Our multiparty key exchange protocol does not require a trusted setup. Moreover, the size of the published value from each user is independent of the total number of users.
- Our broadcast encryption schemes support distributed setup, where users choose their own secret keys. The broadcast ciphertext size is independent of the number of users.
- Our traitor tracing system is fully collusion resistant and provides ciphertexts that are logarithmic in the number of users and constant-sized secret keys. This construction resolves an open problem relating to differential privacy.
Our proof of security for traitor tracing introduces a new tool for iO proofs: the construction makes use of a key-homomorphic symmetric cipher which plays a crucial role in the proof of security.
To overcome this problem, we introduce FlexList: Flexible Length-Based Authenticated Skip List. FlexList translates even variable-size updates to O(u) insertions, removals, or modifications, where u is the size of the update divided by the block size. We present various optimizations on the four types of skip lists (regular, authenticated, rank-based authenticated, and FlexList). We compute one single proof to answer multiple (non-)membership queries and obtain efficiency gains of 35%, 35% and 40% in terms of proof time, energy, and size, respectively. We also deployed our implementation of FlexDPDP (DPDP with FlexList instead of RBASL) on PlanetLab, demonstrating that FlexDPDP performs comparable to the most efficient static storage scheme (PDP), while providing dynamic data support.
This GCHQ-sponsored PhD studentship provides funding for 3.5 years and can commence as soon as possible. GCHQ will cover the costs of university fees and will provide an annual stipend to the student corresponding to the National Minimum Stipend (currently £13,590 per annum) plus an additional sum of £7,000 per annum (both tax free). For comparison this is equivalent to approx. £26,555 annual salary. A further £5k of funding will also be available per annum for travel to conferences, collaborative partners, and GCHQ visits. The studentship is only open to UK nationals and the successful candidate will be required to spend in the region of 2 - 4 weeks per year at GCHQ headquarters in Cheltenham. To be considered for this studentship, candidates must therefore be prepared to undergo GCHQ\\\'s security clearance procedures.
Applicant must have a doctoral degree in computer science or in a related field and must provide 4 necessary documents. (See below URL) Applicants must also arrange for three recommendation letters and send them to isdpt (at) sejong.ac.kr
The application deadline is Oct. 18, 2013 5 p.m. KST (UTC+9). To ensure full consideration, application documents and recommendation letters should be received no later than this date.
Successful candidate is expected to establish an independent research program while contributing to Department\\\'s teaching program in undergraduate and graduate level. Chosen candidate is expected to start his/her duty in Mar. 1, 2014.
Apply online at http://facultyjob.sejong.ac.kr/2013/index.html
The Cryptography group in Tartu (senior members: Dominique Unruh, Helger Lipmaa, Sven Laur) does research on a variety of cryptography related topic, such as quantum cryptography, verification, foundations of cryptography, cryptographic protocols, e-voting, etc. On the coding theory side, we also have Vitaly Skachek.
Researchers at U Tartu are full faculty members. Salary is 2000 euro (cost of living in Estonia is quite low, see e.g. http://www.expatistan.com/cost-of-living), with an employment contract for three years.
A successful candidate should:
To apply, please submit the following documents (by email):
Deadline for applications: 1 November 2013
Do not hesitate to contact us in case of questions.