Search Results - "Rogaway, Phillip"

The Design and Evolution of OCB by Krovetz, Ted, Rogaway, Phillip

“…We describe OCB3, the final version of OCB, a blockcipher mode for authenticated encryption (AE). We prove the construction secure, up to the birthday bound,…”
Get full text

Efficient Garbling from a Fixed-Key Blockcipher by Bellare, Mihir, Hoang, Viet Tung, Keelveedhi, Sriram, Rogaway, Phillip

“…We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per…”
Get full text

Deterministic Encryption with the Thorp Shuffle by Morris, Ben, Rogaway, Phillip, Stegers, Till

“…We analyze the security of the Thorp shuffle, or, equivalently, a maximally unbalanced Feistel network. Roughly said, the Thorp shuffle on  N cards mixes any N…”
Get full text

Reconciling two views of cryptography (The computational soundness of formal encryption) by ABADI, Martin, ROGAWAY, Phillip

“…Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views relies on a simple but…”
Get full text

The Security of the Cipher Block Chaining Message Authentication Code by Bellare, Mihir, Kilian, Joe, Rogaway, Phillip

“…Let F be some block cipher (eg., DES) with block length l. The cipher block chaining message authentication code (CBC MAC) specifies that an m-block message…”
Get full text

CBC MACs for arbitrary-length messages : The three-key constructions by BLACK, John, ROGAWAY, Phillip

“…We suggest some simple variants of the CBC MAC that enable the efficient authentication of arbitrary-length messages. Our constructions use three keys, K1, K2,…”
Get full text

How to protect DES against exhaustive key search (an analysis of DESX) by KILIAN, Joe, ROGAWAY, Phillip

“…The block cipher \DESX is defined by \DESXk.k1.k2(x) = k2\xor \DESk (k1\xor x) , where \xor denotes bitwise exclusive-or. This construction was first suggested…”
Get full text

Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) by Abadi, Martin, Rogaway, Phillip

Get full text

Bucket hashing and its application to fast message authentication by ROGAWAY, P

“…We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x , cast each of its…”
Get full text

A software-optimized encryption algorithm by ROGAWAY, P, COPPERSMITH, D

“…We describe the software-efficient encryption algorithm SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The…”
Get full text

Variationally universal hashing by Krovetz, Ted, Rogaway, Phillip

“…The strongest well-known measure for the quality of a universal hash-function family H is its being ε-strongly universal, which measures, for randomly chosen h…”
Get full text

Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code by Rogaway, P., Stegers, T.

“…Specification documents for real-world authentication protocols typically mandate some aspects of a protocol's behavior but leave other features optional or…”
Get full text

The complexity of approximating a nonlinear program by BELLARE, M, ROGAWAY, P

Get full text

An Enciphering Scheme Based on a Card Shuffle by Hoang, Viet Tung, Morris, Ben, Rogaway, Phillip

“…We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom…”
Get full text

Practice-Oriented Provable Security and the Social Construction of Cryptography by Rogaway, Phillip

“…Cryptographers used to associate provable security with public-key cryptography, asymptotic analyses, and inefficient proof-of-concept designs. These…”
Get full text