Publications associées à Chosen-ciphertext attack

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

Chosen-ciphertext attack

Graph Chatbot

Chattez avec Graph Search

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Analysis and Optimization of Cryptographically Generated Addresses

Cryptanalysis of the ISDB Scrambling Algorithm (MULTI2)

Adaptive Message Authentication for Vehicular Networks

On the Complexity of Asynchronous Gossip

New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

Analysis of lightweight stream ciphers

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Cryptanalysis of the ISDB Scrambling Algorithm (MULTI2)

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Adaptive Message Authentication for Vehicular Networks

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Analysis of lightweight stream ciphers

Analysis and Optimization of Cryptographically Generated Addresses

On the Complexity of Asynchronous Gossip

New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields