Concept

Multimedia Messaging Service

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Private Message Franking with After Opening Privacy

Serge Vaudenay, Iraklis Leontiadis

Recently Grubbs et al. [GLR17] initiated the formal study of message franking protocols. This new type of service launched by Facebook, allows the receiver in a secure messaging application to verifiably report to a third party an abusive message some send ...

2023

Analysis and Improvements of the Sender Keys Protocol for Group Messaging

Daniel Patrick Collins

Messaging between two parties and in the group setting has enjoyed widespread attention both in practice, and, more recently, from the cryptographic community. One of the main challenges in the area is constructing secure (end-to- end encrypted) and effici ...

2022

Power Yoga: Variable-Stretch Security of CCM for Energy-Efficient Lightweight IoT

Damian Vizár, Reza Reyhanitabar, Emiljano Gjiriti

The currently ongoing NIST LWC project aims at identifying new standardization targets for lightweight authenticated encryption with associated data (AEAD) and (optionally) lightweight cryptographic hashing. NIST has deemed it important for performance and ...

RUHR-UNIV BOCHUM, HORST GORTZ INST IT-SICHERHEIT2021

Detection Under One-Bit Messaging Over Adaptive Networks

Ali H. Sayed

This paper studies the operation of multi-agent networks engaged in binary decision tasks, and derives performance expressions and performance operating curves under challenging conditions with some revealing insights. One of the main challenges in the ana ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Optimized Quantization in Distributed Graph Signal Processing

Pascal Frossard, Isabela Cunha Maia Nobre

Distributed graph signal processing methods require that the graph nodes communicate by exchanging messages. These messages have a finite precision in a realistic network, which may necessitate to implement quantization. Quantization, in turn, generates er ...

IEEE2019

Atom: Horizontally Scaling Strong Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system’s capacity scales near ...

Association for Computing Machinery2017

Hirability in the wild: Analysis of online conversational video resumes

Daniel Gatica-Perez, Laurent Son Nguyen

Online social media is changing the personnel recruitment process. Until now, resumes were among the most widely used tools for the screening of job applicants. The advent of inexpensive sensors combined with the success of online video platforms has enabl ...

2016

Right On Time Distributed Shared Memory

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

The demand for real-time data storage in distributed control systems (DCSs) is growing. Yet, providing real- time DCS guarantees is challenging, especially when more and more sensor and actuator devices are connected to industrial plants and message loss n ...

2016

Polar Codes for Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m-independent messages to one codeword while satisfying broadcast constrai ...

Institute of Electrical and Electronics Engineers2015

Compact and Efficient UC Commitments under Atomic-Exchanges

Serge Vaudenay

We devise a multiple (concurrent) commitment scheme operating on large messages. It uses an ideal global setup functionality in a minimalistic way. The commitment phase is non-interactive. It is presented in a modular way so that the internal building bloc ...

2014