IMDEA Software researchers get 8 papers accepted at the CCS Conference

IMDEA Software researchers get 8 papers accepted at the CCS Conference

November 14, 2022

Pic

A bunch of IMDEA Software researchers attended the ACM Conference on Computer and Communications Security (CCS) in Los Ángeles, from November 7-11, to present the 8 papers that were accepted.

ACM is the flagship annual conference of the Special Interest Group on Security, Audit and Control (SIGSAC) of the Association for Computing Machinery (ACM). The conference brings together information security researchers, practitioners, developers, and users from all over the world to explore cutting-edge ideas and results.

In addition to the achievement of having published 8 papers, there are others: Marco Guarnieri’s paper “Automatic Detection of Speculative Execution Combinations” obtained a distinguished paper award and researchers Juan Caballero and Dario Fiore received a best reviewer award.

List of the accepted papers.

  1. Automatic Detection of Speculative Execution Combinations (Xaver Fabian, Marco Guarnieri, Marco Patrignani)

  2. Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams (Dario Fiore, Ida Tucker)

  3. Foundations of Coin Mixing Services (Noemi Glaeser, Matteo Maffei, Giulio Malavolta, Pedro Moreno-Sanchez, Erkan Tairi, Sri Aravinda Krishnan Thyagarajan)

  4. Watch Your Back: Identifying Cybercrime Financial Relationships in Bitcoin through Back-and-Forth Exploration (Gibran Gómez, Pedro Moreno-Sanchez, Juan Caballero)

  5. Enforcing Fine-grained Constant-time Policies (Basavesh Ammanaghatta Shivakumar, Gilles Barthe, Benjamin Grégoire, Vincent Laporte, Swarn Priya)

  6. Sleepy Channels: Bi-directional Payment Channels without Watchtowers (Lukas Aumayr, Sri Aravinda Krishnan Thyagarajan, Giulio Malavolta, Pedro Moreno-Sanchez, Matteo Maffei)

  7. Tidy: Symbolic Verification of Timed Cryptographic Protocols (Gilles Barthe, Ugo Dal Lago, Giulio Malavolta, Itsaka Rakotonirina)

  8. Succinct Zero-Knowledge Batch Proofs for Set Accumulators (Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh)