Publications associées à Partage de clé secrète de Shamir

Differentially private multi-agent constraint optimization

Boi Faltings, Sankarshan Damle, Sujit Prakash Gujar, Aleksei Triastcyn

Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...

Dordrecht2024

Secrecy by Design With Applications to Privacy and Compression

Yanina Yurina Shkel

Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The pr ...

2021

Asynchronous distributed coordination and consensus with threshold logical clocks

Bryan Alexander Ford

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. The invention proposes an approach to simplify asynchronous consensus by building it atop a novel threshold logic ...

2021

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Bryan Alexander Ford

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstracti ...

2019

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

Creating Secrets Out Of Packet Erasures

Christina Fragouli, László Czap, Iris Safaka

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

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

Abstract—The secret keys of critical network authorities – such as time, name, certificate, and software update services – represent high-value targets for hackers, criminals, and spy agencies wishing to use these keys secretly to compromise other hosts. T ...

Ieee2016

Practical and Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recentl ...

IOS Press2015

A 1 x 400 Backside-Illuminated SPAD Sensor With 49.7 ps Resolution, 30 pJ/Sample TDCs Fabricated in 3D CMOS Technology for Near-Infrared Optical Tomography

Edoardo Charbon, Scott Anthony Lindner, Juan Mata Pavia, Martin Wolf

A 1 x 400 array of backside-illuminated SPADs fabricated in 130 nm 3D IC CMOS technology is presented. Sensing is performed in the top tier substrate and time-to-digital conversion in the bottom tier. Clusters of eight pixels are connected to a winner-take ...

Ieee-Inst Electrical Electronics Engineers Inc2015

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

Partage de clé secrète de Shamir

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Practical and Provably Secure Distance-Bounding

A 1 x 400 Backside-Illuminated SPAD Sensor With 49.7 ps Resolution, 30 pJ/Sample TDCs Fabricated in 3D CMOS Technology for Near-Infrared Optical Tomography

On Selecting the Nonce Length in Distance-Bounding Protocols

Graph Chatbot

Chattez avec Graph Search

Differentially private multi-agent constraint optimization

Secrecy by Design With Applications to Privacy and Compression

Asynchronous distributed coordination and consensus with threshold logical clocks

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Scalable Bias-Resistant Distributed Randomness

Creating Secrets Out Of Packet Erasures

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Practical and Provably Secure Distance-Bounding

A 1 x 400 Backside-Illuminated SPAD Sensor With 49.7 ps Resolution, 30 pJ/Sample TDCs Fabricated in 3D CMOS Technology for Near-Infrared Optical Tomography

On Selecting the Nonce Length in Distance-Bounding Protocols

Differentially private multi-agent constraint optimization

Asynchronous distributed coordination and consensus with threshold logical clocks

Scalable Bias-Resistant Distributed Randomness

Creating Secrets Out Of Packet Erasures

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Secrecy by Design With Applications to Privacy and Compression