Publications related to Chosen-ciphertext attack

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

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

Robert Granger

Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...

2010

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Karl Aberer, Hung Le Vu

Ranking systems, such as those in product review sites, and various recommender systems usually employ user ratings to rank favorite items based on their quality and/or popularity. Since higher ranked items are more likely to be selected by customers and t ...

2010

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

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010

Analysis and Optimization of Cryptographically Generated Addresses

Jean-Pierre Hubaux, Joppe Willem Bos, Onur Özen

The need for nodes to be able to generate their own address and verify those from others, without relying on a global trusted authority, is a well-known problem in networking. One popular technique for solving this problem is to use self-certifying address ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Cryptanalysis of the ISDB Scrambling Algorithm (MULTI2)

Pouyan Sepehrdad, Jorge Nakahara, Jean-Philippe Aumasson

MULTI2 is the block cipher used in the ISDB standard for scrambling digital multimedia content. MULTI2 is used in Japan to se- cure multimedia broadcasting, including recent applications like HDTV and mobile TV. It is the only cipher speciﬁed in the 2007 J ...

Springer2009

Adaptive Message Authentication for Vehicular Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Nikodin Ristanovic, Panagiotis Papadimitratos, Georgios Theodorakopoulos

Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues, especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Messag ...

Sheridan Printing2009

On the Complexity of Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the ...

2008

New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

Willi Meier, Shahram Khazaei

In cryptology we commonly face the problem of finding an unknown key K from the output of an easily computable keyed function F(C, K) where the attacker has the power to choose the public variable C. In this work we focus on self-synchronizing stream ciphe ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Analysis of lightweight stream ciphers

Simon Fischer

Stream ciphers are fast cryptographic primitives to provide confidentiality of electronically transmitted data. They can be very suitable in environments with restricted resources, such as mobile devices or embedded systems. Practical examples are cell pho ...

EPFL2008

Chosen-ciphertext attack

Graph Chatbot

Chat with 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

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

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

On the Complexity of Asynchronous Gossip

Analysis of lightweight stream ciphers

Analysis and Optimization of Cryptographically Generated Addresses

Cryptanalysis of the ISDB Scrambling Algorithm (MULTI2)

Adaptive Message Authentication for Vehicular Networks

New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

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

Optimal-Time Adaptive Strong Renaming, with Applications to Counting