IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
20 August 2018
N. Mahdion, Hadi Soleimany, Pouya Habibi, Farokhlagha Moazami
Xiu Xu, Haiyang Xue, Kunpeng Wang, Song Tian, Bei Liang, Wei yu
In the random oracle model, both three-pass AKE and two-pass AKE protocols are secure in the CK model, supporting arbitrary registration of public key, and resistant to the weak perfect forward secrecy (wPFS) attack, key-compromise impersonation (KCI) attack and maximal exposure (MEX) attack, which solves the open problem provided Galbraith of looking for new techniques to design and prove security of AKE in SIDH setting with the widest possible adversarial goals.
Prabhanjan Ananth, Alex Lombardi
We formalize this notion by defining locally simulatable garbling schemes. By suitably realizing this notion, we give a new construction of succinct garbling schemes for Turing machines assuming the polynomial hardness of compact functional encryption and standard assumptions (such as either CDH or LWE). Prior constructions of succinct garbling schemes either assumed sub-exponential hardness of compact functional encryption or were designed only for small-space Turing machines.
We also show that a variant of locally simulatable garbling schemes can be used to generically obtain adaptively secure garbling schemes for circuits. All prior constructions of adaptively secure garbling that use somewhere equivocal encryption can be seen as instantiations of our construction.
Christina Boura, Nicolas Gama, Mariya Georgieva
Kimmo Halunen, Outi-Marja Latvala
Craig Gentry, Charanjit S. Jutla
Zhengan Huang, Junzuo Lai, Wenbin Chen, Man Ho Au, Zhen Peng, Jin Li
Concretely, we first show that some known PKE schemes meet RSIM-SO-CCA security. Then, we introduce the notion of master-key SOA security for identity-based encryption (IBE), and extend the Canetti-Halevi-Katz (CHK) transformation to show generic PKE constructions achieving RSIM-SO-CCA security. Finally, we show how to construct an IBE scheme achieving master-key SOA security.
Juan Garay, Aggelos Kiayias
One of the main issues in consensus research is the many different variants of the problem that exist as well as the various ways the problem behaves when different setup, computational assumptions and network models are considered. In this work we perform a systematization of knowledge in the landscape of consensus research starting with the original formulation in the early 1980s up to the present blockchain-based new class of consensus protocols. Our work is a roadmap for studying the consensus problem under its many guises, classifying the way it operates in many settings and highlighting the exciting new applications that have emerged in the blockchain era.
Yan Michalevsky, Marc Joye
David Urbanik
Assi Barak, Martin Hirt, Lior Koskas, Yehuda Lindell
In this paper, we present the first end-to-end automated system for deploying large-scale MPC protocols between end users, called MPSaaS (for \textit{MPC system-as-a-service}). Our system enables parties to pre-enroll in an upcoming MPC computation, and then participate by either running software on a VM instance (e.g., in Amazon), or by running the protocol on a mobile app, in Javascript in their browser, or even on an IoT device. Our system includes an automation system for deploying MPC protocols, an administration component for setting up an MPC computation and inviting participants, and an end-user component for running the MPC protocol in realistic end-user environments. We demonstrate our system for a specific application of running secure polls and surveys, where the secure computation is run end-to-end with each party actually running the protocol (i.e., without relying on a set of servers to run the protocol for them). This is the first such system constructed, and is a big step forward to the goal of commoditizing MPC.
One of the cryptographic difficulties that arise in this type of setting is due to the fact that end users may have low bandwidth connections, making it a challenge to run an MPC protocol with high bandwidth. We therefore present a protocol based on Beerliova-Trubiniova and Hirt (TCC 2008) with many optimizations, that has very low concrete communication, and the lowest published for small fields. Our protocol is secure as long as less than a third of the parties are \textit{malicious}, and is well suited for computing both arithmetic and Boolean circuits. We call our protocol HyperMPC and show that it has impressive performance. In particular, 150 parties can compute statistics---mean, standard deviation and regression---on 4,000,000 inputs (with a circuit of size 16,000,000 gates of which 6,000,000 are multiplication) in five minutes, and 10 parties can compute the same circuit in 30 seconds. Although our end-to-end system can be used to run any MPC protocol (and we have incorporated numerous protocols already), we demonstrate it for our new protocol that is optimized for end-users without high bandwidth.
17 August 2018
National Chengchi University, Taipei, Taiwan
Initial review of applications will begin on October 1st, 2018 and continue until the position is filled. The position may close when an adequate number of qualified applications are received.
We seek candidates in research areas related to all fields in Computer Science. Candidates from the following research areas are especially welcome:
• Artificial Intelligence
• Information Security
• Interdisciplinary fields of computer science and social science (eg., CS and Digital Content, CS and Communication, CS and Finance, etc. )
At a minimum, candidates must have a Ph.D. degree in Computer Science or a closely related field and have demonstrated strong research ability.
Applicants must send curriculum vitae, transcripts, diploma certificate, a copy of Ph.D. dissertation or abstract, recent publications, and at least two recommendation letters to recruit (at) cs.nccu.edu.tw or
Faculty Recruit Committee Department of Computer Science
National Chengchi University
64, Sec. 2, ZhiNan Rd. Wenshan District
Taipei, Taiwan, 11605
R.O.C.
Applicants are invited to visit our web page at https://www.cs.nccu.edu.tw .
Closing date for applications: 1 February 2019
Contact: Raylin Tso
Chairman of the Department of Computer Science, National Chengchi University
eMail: raylin (at) cs.nccu.edu.tw
More information: https://www.cs.nccu.edu.tw
InfoSec Global, Zurich, Switzerland or Toronto, Canada
• Implementation of cryptographic primitives (optimizations, countermeasures)
• Implementation of security protocols
• Side-channel analysis of implementations
• C programming proficiency
• Applied research in cryptography and security
• Patent and standards development
You have a Master in Computer Science with 5 years of experience in Security Engineering or a PhD in Computer Science with a focus on Security and a profound knowledge in cryptography and embedded devices
Skills:
• Software development in C and Java
• Development on embedded devices
• Experience with development on Android and iOS
• Experience with ARM processors
• Experience with side-channel analysis and attacks
• Experience with implementation of cryptographic primitives
• Experience with Latex
• Experience with applied research
Closing date for applications: 19 October 2018
Contact: Jennifer Quaid
ISG
jennifer.quaid (at) infosecglobal.com
InfoSec Global, Zurich, Switzerland
• Writing and publishing and public speaking
• Prototyping, proof of concept development
• Consultancy in the field of asymmetric cryptography
• Applied research in post quantum cryptography
• Patent and standards development
Education Required:
• PhD in Cryptography
• Profound knowledge in cryptography
• Profound knowledge in lattice-based cryptography
• Profound knowledge in code-based cryptography
• Profound knowledge in isogeny-based cryptography
Skills:
• Software development in C, Java or Python
• Experience with implementation of cryptographic primitives
• Experience with development on Windows, Linux, Android and iOS
• Experience with Latex
• Experience with applied research
Closing date for applications: 31 October 2018
Contact: Jennifer Quaid
InfoSec Global
jennifer.quaid (at) infosecglobal.com
InfoSec Global, Zurich, Switzerland or Toronto, Canada
• Writing and publishing and public speaking
• Design and analysis of IT security systems
• Prototype, proof of concept development
• Consultancy in the field of secure systems
• Applied research in cryptography and security
• Patent and standards development
Education and Experience: You have a Master in Computer Science with 5 years of experience in Security Engineering or a PhD in Computer Science with focus on Security, and a profound knowledge in cryptography, network security, systems engineering, security design, cloud security and security protocols.
Skills: Software development in C, Java and Python, Experience with security in Windows, Linux, Android and iOS, Experience with cloud infrastructure, Experience with IoT environment, Experience with Latex, Experience with applied research
Closing date for applications: 31 October 2018
Contact: Jennifer Quaid
InfoSec Global
jennifer.quaid (at) infosecglobal.com
Gaithersburg, USA, 11 March - 12 March 2019
Submission deadline: 17 December 2018
Notification: 15 January 2019
Vipul Goyal, Ashutosh Kumar
We continue this line of research and construct NMSS for more general access structures. We give a generic compiler that converts any statistical (resp. computational) secret sharing scheme realizing any access structure into another statistical (resp. computational) secret sharing scheme that not only realizes the same access structure but also ensures statistical non-malleability against a computationally unbounded adversary who tampers each of the shares arbitrarily and independently. Instantiating with known schemes we get unconditional NMMS schemes that realize any access structures generated by polynomial size monotone span programs. Similarly, we also obtain conditional NMMS schemes realizing access structure in monotoneP (resp. monotoneNP) assuming one-way functions (resp. witness encryption).
Towards considering more general tampering models, we also propose a construction of n-out-of-n NMSS. Our construction is secure even if the adversary could divide the shares into any two (possibly overlapping) subsets and then arbitrarily tamper the shares in each subset. Our construction is based on a property of inner product and an observation that the inner-product based construction of Aggarwal, Dodis and Lovett (STOC'14) is in fact secure against a tampering class that is stronger than 2 split-states. We also show applications of our construction to the problem of non-malleable message transmission.