Publications related to Simple Mail Transfer Protocol

Efficient protocols for oblivious linear function evaluation from ring-LWE

An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...

IOS PRESS2022

Flow Path Optimization for Soft Pneumatic Actuators: Towards Optimal Performance and Portability

Jamie Paik, Harshal Arun Sonar, Sagar Dattatray Joshi

Soft pneumatic actuators (SPAs) are highly desirable for interactive robotics applications owing to their unconventional properties like high compliance, safe human-machine interaction and adaptable design space. The SPA dynamic behaviour is governed by pn ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Symmetric Asynchronous Ratcheted Communication with Associated Data

Serge Vaudenay, Hailun Yan

Following up mass surveillance and privacy issues, modern secure communication protocols now seek strong security, such as forward secrecy and post-compromise security, in the face of state exposures. To address this problem, ratcheting was thereby introdu ...

Springer, Cham2020

Reducing Metadata Leakage from Encrypted Files and Communication with PURBs

Jean-Pierre Hubaux, Bryan Alexander Ford, Ludovic Barman, Kirill Nikitin, Wouter Lueks, Matthew Joshua Underwood

Most encrypted data formats leak metadata via their plaintext headers, such as format version, encryption schemes used, number of recipients who can decrypt the data, and even the recipients’ identities. This leakage can pose security and privacy risks to ...

Sciendo2019

PdII2L4-type coordination cages up to three nanometers in size

Rosario Scopelliti, Kay Severin, Suzanne Maria Jansze, Matthew David Wise

The utilization of large ligands in coordination-based self-assembly represents an attractive strategy for the construction of supramolecular assemblies more than two nanometers in size. However, the implementation of this strategy is hampered by the fact ...

2017

Scalable Bias-Resistant Distributed Randomness

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

Ieee2017

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

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.