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.
the performance of practical implementations of, among others, algo-
rithms for the Shortest Vector Problem (SVP).
In this paper, we conduct a comprehensive, empirical comparison of two
SVP-solvers: ListSieve and GaussSieve. We also propose a practical par-
allel implementation of ListSieve, which achieves super-linear speedups
on multi-core CPUs, with efficiency levels as high as 183%. By compar-
ing our implementation with a parallel implementation of GaussSieve, we
show that ListSieve can, in fact, outperform GaussSieve for a large num-
ber of threads, thus answering a question that was still open to this day.
(SSPs). We first characterize NP as affine map constraints on small
vectors. We then relate this characterization to SSPs, which are
similar but simpler than Quadratic Span Programs (QSPs) and
Quadratic Arithmetic Programs (QAPs) since they use a single series
of polynomials rather than 2 or 3.
We use SSPs to construct succinct non-interactive zero-knowledge
arguments of knowledge. For performance, our proof system is
defined over Type III bilinear groups; proofs consist of just 4
group elements, verified in just 6 pairings. Concretely, using the
Pinocchio libraries, we estimate that proofs will consist of 160
bytes verified in less than 6 ms.
added feature that the (master) secret key holder, having secret key K, can produce a constrained key, K_f, that allows for the evaluation of the PRF on a subset of the domain as determined by a predicate function f within some family F. While previous constructions gave constrained PRFs for poly-sized circuits, all reductions for such functionality were based in the selective model of security where an attacker declares which point he is attacking before seeing any constrained keys.
In this paper we give new constrained PRF constructions for circuits that have polynomial reductions to indistinguishability obfuscation in the random oracle model. Our solution is constructed from two recently emerged primitives: an adaptively secure Attribute-Based
Encryption (ABE) for circuits and a Universal Parameters as introduced by Hofheinz et al.
Both primitives are constructible from indistinguishability obfuscation (iO)
(and injective pseudorandom generators) with only polynomial loss.
There is an anonymous comment which argues that the states in these registers are entangled. If so, the entanglement involving many quantum registers can not be interpreted by the mechanism of EPR pairs and the like. In view of this peculiar entanglement has not yet been mentioned and investigated, we think the claim that the Shor\'s algorithm runs in polynomial time needs more physical verifications. We also discuss the problem to certify quantum computers.
This prestigious four year Research Fellowship is a fantastic opportunity to build upon the foundations of an academic career and will lead to an academic post, subject to performance. The purpose of the scheme is to support the Fellows in pursuing their research. There will be a lighter teaching load and administration responsibilities during the award. Some teaching responsibilities will be introduced into the role to ensure the post-holder can transition appropriately to an academic post.
To support our ambitious research strategy we are currently making a substantial investment in our priority research areas and expect to award 20 fellowships at this time
Applicants with research expertise in Cyber Security are encouraged to apply. The salary scale for the posts is Ac3 £38,511 - £50,200 per annum (including contribution points).