Open AccessJournal Article
From unpredictability to indistinguishability : A simple construction of pseudo-random functions from MACs
Moni Naor,Omer Reingold +1 more
TLDR
In this paper, the relationship between unpredictable functions and pseudo-random functions is studied and a transformation of the former to the latter using a unique application of the Goldreich-Levin hard core bit is proposed.Abstract:
This paper studies the relationship between unpredictable functions (which formalize the concept of a MAC) and pseudo-random functions. We show an efficient transformation of the former to the latter using a unique application of the Goldreich-Levin hard-core bit (taking the inner-product with a random vector r): While in most applications of the GL-bit the random vector r may be public, in our setting this is not the case. The transformation is only secure when r is secret and treated as part of the key. In addition, we consider weaker notions of unpredictability and their relationship to the corresponding notions of pseudo-randomness. Using these weaker notions we formulate the exact requirements of standard protocols for private-key encryption, authentication and identification. In particular, this implies a simple construction of a private-key encryption scheme from the standard challenge-response identification scheme.read more
Citations
More filters
Proceedings ArticleDOI
Multicast security: a taxonomy and some efficient constructions
TL;DR: A taxonomy of multicast scenarios on the Internet and an improved solution to the key revocation problem are presented, which can be regarded as a 'midpoint' between traditional message authentication codes and digital signatures.
Book ChapterDOI
On Cryptographic Assumptions and Challenges
TL;DR: This work proposes several open problems regarding cryptographic tasks that currently do not have a good challenge of that sort by creating a challenge to their validity by classifying computational assumptions based on the complexity of falsifying them.
Book ChapterDOI
Distributed Pseudo-random functions and KDCs
TL;DR: The solutions presented enable the operation of many servers, preventing bottlenecks or single points of failure and are far better than the known partitioning to domains or replication solutions to this problem, and are especially suited to handle users of multicast groups.
Patent
Block encryption method and schemes for data confidentiality and integrity protection
TL;DR: In this article, the authors proposed a block encryption method and schemes that provide both data confidentiality and integrity with a single cryptographic primitive and a single processing pass over the input plaintext string by using a non-cryptographic Manipulation Detection Code function.
Book ChapterDOI
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
TL;DR: The eXtended Ciphertext Block Chaining (XCBC) and the eXTended Electronic Codebook (XECB) encryption schemes or modes of encryption that can detect encrypted-message forgeries with high probability even when used with typical noncryptographic Manipulation Detection Code (MDC) functions are presented.