IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
02 December 2018
Akshayaram Srinivasan, Prashant Nalini Vasudevan
In this work, we give a compiler that takes a secret sharing scheme for any monotone access structure and produces a local leakage resilient secret sharing scheme for the same access structure, with only a constant-factor blow-up in the sizes of the shares. Furthermore, the resultant secret sharing scheme has optimal leakage-resilience rate i.e., the ratio between the leakage tolerated and the size of each share can be made arbitrarily close to $1$. Using this secret sharing scheme as the main building block, we obtain the following results:
1. Rate Preserving Non-Malleable Secret Sharing: We give a compiler that takes any secret sharing scheme for a 4-monotone access structure with rate $R$ and converts it into a non-malleable secret sharing scheme for the same access structure with rate $\Omega(R)$. The prior such non-zero rate construction (Badrinarayanan and Srinivasan, 18) only achieves a rate of $\Theta(R/{t_{\max}\log^2 n})$, where $t_{\max}$ is the maximum size of any minimal set in the access structure. As a special case, for any threshold $t \geq 4$ and an arbitrary $n \geq t$, we get the first constant rate construction of $t$-out-of-$n$ non-malleable secret sharing.
2. Leakage-Tolerant Multiparty Computation for General Interaction Pattern: For any function, we give a reduction from constructing leakage-tolerant secure multi-party computation protocols obeying any interaction pattern to constructing a secure (and not necessarily leakage-tolerant) protocol for a related function obeying the star interaction pattern. This improves upon the result of (Halevi et al., ITCS 2016), who constructed a protocol that is secure in a leak-free environment.
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren
Qingzhao Zhang, Yijun Leng, Lei Fan
We envision that our solution is not only promising for P2P file sharing but also a stepping stone for general data sharing applications over the public blockchain.
Bing Zeng
Gorjan Alagic, Christian Majenz, Alexander Russell, Fang Song
Changhai Ou, Chengju Zhou, Siew-Kei Lam
Mirosław Kutyłowski, Lucjan Hanzlik, Kamil Kluczniak
Divesh Aggarwal, Ivan Damgard, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, Joao Ribeiro, Mark Simkin
We show how to use leakage-resilient and non-malleable secret sharing schemes to construct leakage-resilient and non-malleable threshold signatures. Classical threshold signatures allow to distribute the secret key of a signature scheme among a set of parties, such that certain qualified subsets can sign messages. We construct threshold signature schemes that remain secure even if an adversary leaks from or tampers with all secret shares.
Deepak Sirone, Pramod Subramanyan
In comparison to past work, the FALL attack is more practical as it can often succeed (90% of successful attempts in our experiments) by only analyzing the locked netlist, without requiring oracle access to an unlocked circuit. Further, FALL attacks successfully defeat Secure Function Logic Locking (SFLL), the only locking algorithm that is resilient to known attacks on logic locking. Our experimental evaluation shows that FALL is able to defeat 65 out of 80 (81%) circuits locked using SFLL.
Fenghua Li, Hui Li, Ben Niu, Jinjun Chen
Saikrishna Badrinarayanan, Akshayaram Srinivasan
In this work, we continue the study of threshold non-malleable secret sharing against the class of tampering functions that tamper each share independently. We focus on achieving greater efficiency and guaranteeing a stronger security property. We obtain the following results:
- Rate Improvement. We give the first construction of a threshold non-malleable secret sharing scheme that has rate $> 0$. Specifically, for every $n,t \geq 4$, we give a construction of a $t$-out-of-$n$ non-malleable secret sharing scheme with rate $\Theta(\frac{1}{t\log ^2 n})$. In the prior constructions, the rate was $\Theta(\frac{1}{n\log m})$ where $m$ is the length of the secret and thus, the rate tends to 0 as $m \rightarrow \infty$. Furthermore, we also optimize the parameters of our construction and give a concretely efficient scheme.
- Multiple Tampering. We give the first construction of a threshold non-malleable secret sharing scheme secure in the stronger setting of bounded tampering wherein the shares are tampered by multiple (but bounded in number) possibly different tampering functions. The rate of such a scheme is $\Theta(\frac{1}{k^3t\log^2 n})$ where $k$ is an apriori bound on the number of tamperings. We complement this positive result by proving that it is impossible to have a threshold non-malleable secret sharing scheme that is secure in the presence of an apriori unbounded number of tamperings.
- General Access Structures. We extend our results beyond threshold secret sharing and give constructions of rate-efficient, non-malleable secret sharing schemes for more general monotone access structures that are secure against multiple (bounded) tampering attacks.
30 November 2018
Yeshiva University
Yeshiva University’s Katz School seeks a dynamic director to serve as academic and administrative lead for its graduate initiatives in Data Science and related programs.
Position Responsibilities:
• Provide transformative direction and oversight in teaching, research and community
• Oversee curriculum development, academic policies, and assessment
• Ensure student academic and professional success
• Lead faculty recruitment, hiring, development, and evaluation
• Recruit highly qualified students, with an expectation of significant program growth
• Obtain relevant industry affiliations and designations
• Raise the visibility of the Katz School and University
• Establish partnerships with local, regional, national, and international organizations
• Develop grants, contracts, philanthropy, and research development
• Manage budgets and resources
Required Experience & Educational Background:
• Master’s degree in data science, computer science, or related field
• Professional experience in data science or related fields
To apply, visit: http://apptrkr.com/1336277
About Us:
Founded in 1886, Yeshiva University (YU) has a strong tradition of combining Jewish scholarship with academic excellence and achievement in the liberal arts, sciences, medicine, law, business, social work, Jewish studies, education, psychology, and more. We seek to attract and retain engaged and committed individuals who contribute to an exciting working environment, where there is a sense of community and belonging, balanced with a significant cross section of people from diverse backgrounds working and studying together.
Yeshiva University is an equal opportunity employer committed to hiring minorities, women, individuals with disabilities and protected veterans.
Closing date for applications:
More information: http://apptrkr.com/1336277
Chalmers University of Technology, Sweden
The position is fully funded for 2 years and it would be extended under conditions for 2 more.
The post-doc will be hired at the department of Computer Science and Engineering at Chalmers and will be working under the supervision of Prof. Katerina Mitrokotsa.
The preferred starting date is in April 2019.
To apply send an email with subject: post-doc in cryptography and the following documents:
- CV, research statement, list of publications and names of at least two referees
Closing date for applications: 5 January 2019
Contact: Katerina Mitrokotsa
Associate Professor,
Chalmers University of Technology
Department of Computer Science and Engineering,
Gothenburg, Sweden
More information: http://www.cse.chalmers.se/~aikmitr/
University of Waterloo, Waterloo, Ontario, Canada
PDF applicants with a recent PhD in Computer/Electrical Engineering or Computer Science and publications at premium venues are encouraged to send their CVs and cover letters via email to ahasan at uwaterloo.ca.
PhD student applicants with mathematical maturity and research experience in cryptographic engineering or applied cryptography, who meet the admission requirements for the PhD program in Electrical and Computer Engineering at the University of Waterloo, are encouraged to apply online following this link https://uwaterloo.ca/electrical-computer-engineering/future-graduate-students/programs
Closing date for applications: 11 January 2019
Canadian Institute for Cybersecurity (CIC)
Position Description:
We are currently looking for PhD and Post-doc researchers to fill various roles within our cyber security research and projects.
Required skills and experience:
- A computer science degree (Master for PhD candidates, PhD for Post-doc candidates) with expertise in network and information security, networking, and other relevant research area. (completed by the start of appointment)
- Strong communication and writing skills.
- Ability to do independent research, as well as to work collaboratively with other team members.
Helpful skills and experience:
- Application development using Java and Python
- Technical abilities in systems design, coding, testing, debugging, and maintenance.
- Demonstrated experience with the design and implementation of large networked and security systems.
Applications will be considered until the available positions are filled. To apply please include your curriculum vitae and the following:
- Research experience (projects, publications, etc.)
- Two representative publications (post-doc candidates)
- Proof of language proficiency (international applicants)
- Contact information (email, address, phone) of three references
Closing date for applications: 30 April 2019
Contact:
Arash Habibi Lashkari, PhD
Assistant Professor and Research Coordinator
Canadian Institute for Cybersecurity (CIC)
University of New Brunswick (UNB)
Fredericton, NB, Canada
A.habibi.l (at) unb.ca
More information: http://www.unb.ca/cic
University of Birmingham
Previous work in this field would be a plus but is not required. Generally, a strong background in algorithmic number theory, cryptographic protocols, cryptanalysis and/or applied cryptography is sought.
The position is for up to 30 months.
Informal inquiries are welcome.
Closing date for applications: 3 January 2019
Contact: Christophe Petit christophe.f.petit (at) gmail.com
More information: https://atsv7.wcn.co.uk/search_engine/jobs.cgi?SID=amNvZGU9MTc2OTA5NiZ2dF90ZW1wbGF0ZT03Njcmb3duZXI9NTAzMjUyMSZvd25lcnR5c
University of Birmingham
The ideal candidate will have a master in Mathematics, Computer Science or Electrical Engineering. Previous knowledge in cryptography and/or number theory is a plus.
Informal inquiries welcome.
Closing date for applications: 14 January 2019
Contact: Christophe Petit christophe.f.petit (at) gmail.com
More information: https://www.birmingham.ac.uk/postgraduate/courses/findaphd.aspx
RWC 2019 will be held January 9-11 in San Jose, California, USA.