Pseudorandom function family

Known as: Pseudo-random function, Pseudorandom function

In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

We propose a multi-user Symmetric Searchable Encryption (SSE) scheme based on the single-user Oblivious Cross Tags (OXT) protocol…

2014

Secure group communication systems have become increasingly important for many emerging network applications. An efficient and…

2014

Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in…

2013

This article proposes a hashing mode using a lightweight blockcipher. Since the block size of a lightweight blockcipher is small…

2012

2009

With the increase of network service types and users’ broadband demand, broadband wireless access (BWA) has become the focus of…

2009

This article discusses the provable security of pseudorandom-function (PRF) modes of an iterated hash function using a block…

2008

Trusted platform modules (TPMs) are hardware modules that are bound to a computer's motherboard, that are being included in many…

2007

Packet sampling supports a range of Internet measurement applications including characterizing the spatial flow of traffic…

2007

Cryptographic primitives, such as hash functions and block ciphers, are integral components in several practical cryptographic…