Publications associées à LPN in Cryptography

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

LPN in Cryptography

Graph Chatbot

Chattez avec Graph Search

NoRSE: noise reduction and state evaluator for high-frequency single event traces

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution

The chemical dynamics of nanosensors capable of single-molecule detection

Broadcast Encryption and Traitor Tracing for Conditional Access Systems

A Related-Key Attack against Multiple Encryption based on Fixed Points

Cryptographic Hash Functions in Groups and Provable Properties

OREN: Optimal Revocations in Ephemeral Networks

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Efficient Fail-Stop Signatures from the Factoring Assumption

Discrete time stochastic hybrid dynamical games: Verification & controller synthesis

Broadcast Encryption and Traitor Tracing for Conditional Access Systems

A Related-Key Attack against Multiple Encryption based on Fixed Points

NoRSE: noise reduction and state evaluator for high-frequency single event traces

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution

The chemical dynamics of nanosensors capable of single-molecule detection

Cryptographic Hash Functions in Groups and Provable Properties

Efficient Fail-Stop Signatures from the Factoring Assumption

Discrete time stochastic hybrid dynamical games: Verification & controller synthesis

OREN: Optimal Revocations in Ephemeral Networks

Optimal-Time Adaptive Strong Renaming, with Applications to Counting