IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
29 October 2020
Vivek Arte, Mihir Bellare, Louiza Khati
ePrint ReportLilya Budaghyan, Marco Calderini, Claude Carlet, Diana Davidova, Nikolay Kaleyski
ePrint ReportHagar Dolev, Shlomi Dolev
ePrint ReportCong Zuo, Shi-Feng Sun, Joseph K. Liu, Jun Shao, Josef Pieprzyk, Guiyi Wei
ePrint ReportWe give two DSSE schemes with forward and backward privacy, which support conjunctive queries, and they are suitable for different applications. In particular, we first introduce a new data structure termed the extended bitmap index. Then we describe our forward and backward private DSSE schemes, which support conjunctive queries. Our security analysis proves the claimed privacy characteristics, and experiments show that our schemes are practical. Compared to the state-of-the-art DSSE VBTree supporting conjunctive queries (but not backward privacy), our schemes offer search time that is a few orders of magnitude faster. Besides, our schemes claim better security (called Type-C backward privacy).
Maria Eichlseder, Gregor Leander, Shahram Rasoolzadeh
ePrint ReportCharanjit Singh Jutla, Nathan Manohar
ePrint ReportNicholas Genise, Baiyu Li
ePrint ReportLinru Zhang, Xiangning Wang, Yuechen Chen, Siu-Ming Yiu
ePrint ReportLinda Chen, Jun Wan
ePrint ReportAshrujit Ghoshal, Stefano Tessaro
ePrint ReportThis paper initiates the study of {\em state-restoration soundness} in the algebraic group model (AGM) of Fuchsbauer, Kiltz, and Loss (CRYPTO '18). This is a stronger notion of soundness for an interactive proof or argument which allows the prover to rewind the verifier, and which is tightly connected with the concrete soundness of the non-interactive argument obtained via the Fiat-Shamir transform.
We propose a general methodology to prove tight bounds on state-restoration soundness, and apply it to variants of Bulletproofs (Bootle et al, S\&P '18) and Sonic (Maller et al., CCS '19). To the best of our knowledge, our analysis of Bulletproofs gives the {\em first} non-trivial concrete security analysis for a non-constant round argument combined with the Fiat-Shamir transform.
Rishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng, Raluca Ada Popa, Joseph M. Hellerstein
ePrint ReportWe present Senate, a system that allows multiple parties to collaboratively run analytical SQL queries without revealing their individual data to each other. Unlike prior works on secure multi-party computation (MPC) that assume that all parties are semi-honest, Senate protects the data even in the presence of malicious adversaries. At the heart of Senate lies a new MPC decomposition protocol that decomposes the cryptographic MPC computation into smaller units, some of which can be executed by subsets of parties and in parallel, while preserving its security guarantees. Senate then provides a new query planning algorithm that decomposes and plans the cryptographic computation effectively, achieving a performance of up to 145$\times$ faster than the state-of-the-art.
Howard M. Heys
ePrint ReportMartha Norberg Hovd, Martijn Stam
ePrint ReportWe present three versions: Anonymous, Identifiable, and Opaque VE (AVE, IVE and OVE), and concentrate on formal definitions, security notions and examples of instantiations based on preexisting primitives of the latter two. For IVE, the sender is identifiable both to the filter and the receiver, and we make the comparison with identity-based signcryption. For OVE, a sender is anonymous to the filter, but is identified to the receiver. OVE is comparable to group signatures with message recovery, with the important additional property of confidentiality of messages.
Melissa Azouaoui, Davide Bellizia, Ileana Buhan, Nicolas Debande, Sebastien Duval, Christophe Giraud, Eliane Jaulmes, Francois Koeune, Elisabeth Oswald, Francois-Xavier Standaert, Carolyn Whitnall
ePrint ReportShlomi Dolev, Ziyu Wang
ePrint ReportErkan Tairi, Pedro Moreno-Sanchez, Matteo Maffei
ePrint ReportIn this work, we present IAS, a construction for adaptor signatures that relies on standard cryptographic assumptions for isogenies, and builds upon the isogeny-based signature scheme CSI-FiSh. We formally prove the security of IAS against a quantum adversary. We have implemented IAS and our evaluation shows that IAS can be incorporated into current blockchains while requiring $\sim1500$ bytes of storage size on-chain and $\sim140$ milliseconds for digital signature verification. We also show how IAS can be seamlessly leveraged to build post-quantum off-chain payment applications such as payment-channel networks without harming their security and privacy.
University of Birmingham
Job PostingClosing date for applications:
Contact: Dr David Oswald
More information: https://www.jobs.ac.uk/job/CCF964/research-felllow-in-cyber-security
Tenure-track and Tenured faculty related to efficient algorithms & the foundations of theoretical CS
CISPA Helmholtz Center for Information Security
Job PostingCISPA offers two main types of faculty positions.
Tenure track: these positions are intended for candidates with excellent research credentials and the potential to pursue a program of innovative research. The positions are comparable to tenure-track positions at a leading university, and come with two full time research staff positions and generous support for other expenses.
Tenured: these positions are intended for established leading researchers with an outstanding scientific track record, and can be compared to an endowed chair at a leading university. All applicants are expected to build up a research team that pursues an internationally visible research agenda. Candidates for senior positions must be internationally renowned scientists.
All applicants are strongly encouraged to submit their complete application by November 30, 2020 for full consideration. However, applications will continue to be accepted until December 10, 2020.
CISPA values diversity and is committed to equality. We provide special support for dual-career couples. We highly encourage female researchers to apply. For more information about CISPA, see https://cispa.saarland
Closing date for applications:
Contact: scientific-recruiting@cispa.saarland
More information: https://jobs.cispa.saarland/jobs/department/faculty-14
CISPA Helmholtz Center for Information Security
Job Posting
CISPA offers two main types of faculty positions.
Tenure track: these positions are intended for candidates with excellent research credentials and the potential to pursue a program of innovative research. The positions are comparable to tenure-track positions at a leading university, and come with two full time research staff positions and generous support for other expenses.
Tenured: these positions are intended for established leading researchers with an outstanding scientific track record, and can be compared to an endowed chair at a leading university. All applicants are expected to build up a research team that pursues an internationally visible research agenda. Candidates for senior positions must be internationally renowned scientists.
All applicants are strongly encouraged to submit their complete application by November 30, 2020 for full consideration. However, applications will continue to be accepted until December 10, 2020.
CISPA values diversity and is committed to equality. We provide special support for dual-career couples. We highly encourage female researchers to apply. For more information about CISPA, see https://cispa.saarland
Closing date for applications:
Contact: scientific-recruiting@cispa.saarland
More information: https://jobs.cispa.saarland/de_DE/jobs/department/faculty-14
Duke University, Durham, NC, USA
Job Posting- Blockchain and smart contract security
- Trusted hardware security
- Scalable and fair consensus protocols
- Privacy enhancing technology (e.g., anonymous communication)
Closing date for applications:
Contact: Fan Zhang
More information: https://www.fanzhang.me/opening/ads.html