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.
Please see the job posting at UMJOBS.ORG for the full description, salary range, and requirements.
ALL APPLICANTS MUST APPLY DIRECTLY TO THE UNIVERSITY OF MICHIGAN AT UMJOBS.ORG. APPLICATIONS SUBMITTED ELSEWHERE WILL NOT BE CONSIDERED.
UMTRI is currently establishing a world-class transportation cyber-security team. For this team we seek motivated, energetic, independently working team players. The successful candidate for this position will lead and manage the design, planning, coordination, staffing, development and testing of large cyber-security projects at the University of Michigan Transportation Research Institute (UMTRI), including work for industrial partners, government sponsors and Safety Pilot Model Deployment (http://safetypilot.umtri.umich.edu/). The successful incumbent will be required to interact with sponsors, industry partners, principal investigators, other engineering and technical staff, and project stakeholders in defining project scope, preparation of components of related research proposals, and other plans related to cyber security projects. The incumbent will be expected to prepare documentation and participate in the development of publications and technical reports, and present results.
Duties will also include supervision and management of programming and engineering staff on project planning, development, integration and execution. At the senior level, experience in the area of project design and deployment is included, but leadership will not include supervision of 3+ programmers and/or engineers.
Please visit the posting on UMJOBS.ORG for more information regarding required and desired qualifications, underfill requirements, and the mandatory background screening.
U-M EEO/AA Statement
The University of Michigan is an equal opportunity/affirmative action employer.
Candidates should have a Master’s degree in electronics, computer science or applied mathematics, with strong interest in algorithms and signal processing. Prior experience in side channel analysis and embedded software or hardware design is an asset.
We offer a competitive salary and an international cutting-edge research program in an attractive working environment. WPI is one of the highest-ranked technical colleges in the US. Located in the greater Boston area, it maintains close interaction with many of the nearby universities and companies.
standard non-malleability security notion - so-called continuous non-malleability - where we allow the adversary to tamper continuously with an encoding. This is in contrast to the standard notion of
non-malleable codes where the adversary only is allowed to tamper a single time with an encoding. We show how to construct continuous non-malleable codes in the common split-state model where an encoding consist of two parts and the tampering can be arbitrary but has to be independent with both parts. Our main contributions are outlined below:
1. We propose a new uniqueness requirement of split-state codes which states that it is computationally hard to find two codewords C = (X0;X1) and C0 = (X0;X1\') such that both codewords are valid, but X0 is the same in both C and C0. A simple attack shows that uniqueness
is necessary to achieve continuous non-malleability in the split-state model. Moreover, we illustrate that none of the existing constructions satisfies our uniqueness property and hence is not secure in the continuous setting.
2. We construct a split-state code satisfying continuous non-malleability. Our scheme is based
on the inner product function, collision-resistant hashing and non-interactive zero-knowledge
proofs of knowledge and requires an untamperable common reference string.
3. We apply continuous non-malleable codes to protect arbitrary cryptographic primitives against tampering attacks. Previous applications of non-malleable codes in this setting required to
perfectly erase the entire memory after each execution and and required the adversary to be restricted in memory. We show that continuous non-malleable codes avoid these restrictions.