Global Information Lookup Global Information

Oblivious pseudorandom function information


An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two parties cooperate to securely compute a pseudorandom function (PRF).[1]

  1. ^ Casacuberta, Sílvia; Hesse, Julia; Lehmann, Anja (2022). "SoK: Oblivious Pseudorandom Functions". Cryptology ePrint Archive. Paper 2022/302.

and 19 Related for: Oblivious pseudorandom function information

Request time (Page generated in 0.7986 seconds.)

Oblivious pseudorandom function

Last Update:

An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two parties...

Word Count : 3333

Pseudorandom function family

Last Update:

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

Word Count : 1023

PBKDF2

Last Update:

confidentiality of the password. This can be done using an oblivious pseudorandom function to perform password-hardening. This can be done as alternative...

Word Count : 1341

Verifiable random function

Last Update:

In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly...

Word Count : 1501

Key management

Last Update:

Management System (EKMS) Over-the-air rekeying Pseudorandom function family Oblivious Pseudorandom Function Public key infrastructure Turner, Dawn M. "What...

Word Count : 3481

Cryptographic hash function

Last Update:

guarantees; for example, SHACAL, BEAR and LION. Pseudorandom number generators (PRNGs) can be built using hash functions. This is done by combining a (secret) random...

Word Count : 6067

Outline of cryptography

Last Update:

selection MAC; Intel, UNevada Reno, IBM, Technion, & UC Davis Oblivious Pseudorandom Function MD5 – one of a series of message digest algorithms by Prof...

Word Count : 1876

OPRF

Last Update:

High School, Chicago, Illinois, United States Oblivious pseudorandom function, a cryptographic function This disambiguation page lists articles associated...

Word Count : 52

Oblivious RAM

Last Update:

An Oblivious RAM (ORAM) simulator is a compiler that transforms an algorithm in such a way that the resulting algorithm preserves the input-output behavior...

Word Count : 3993

Silvio Micali

Last Update:

fundamental early work on public-key cryptosystems, pseudorandom functions, digital signatures, oblivious transfer, secure multiparty computation, and is...

Word Count : 624

Randomness extractor

Last Update:

conceptual similarities with a pseudorandom generator (PRG), but the two concepts are not identical. Both are functions that take as input a small, uniformly...

Word Count : 3133

Quantum cryptography

Last Update:

an unconditionally secure protocol for performing so-called oblivious transfer. Oblivious transfer, on the other hand, had been shown by Kilian to allow...

Word Count : 8933

Indistinguishability obfuscation

Last Update:

existence of a super-linear stretch pseudorandom generator in the function class NC0. (The existence of pseudorandom generators in NC0 (even with sub-linear...

Word Count : 2086

SWIFFT

Last Update:

functions, from which one function is chosen at random (and obliviously to the input). SWIFFT is not pseudorandom, due to linearity. For any function...

Word Count : 1947

Circuit complexity

Last Update:

other hand, natural properties useful against P/poly would break strong pseudorandom generators. This is often interpreted as a "natural proofs" barrier for...

Word Count : 2565

Index of cryptography articles

Last Update:

secure pseudorandom number generator • Cryptographically strong • Cryptographic Application Programming Interface • Cryptographic hash function • Cryptographic...

Word Count : 2943

Oded Goldreich

Last Update:

Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing, and other areas in...

Word Count : 1363

Machtey Award

Last Update:

Rakesh K. Sinha, T.S. Jayram (Washington) "Efficient Oblivious Branching Programs for Threshold Functions" Jeffrey C. Jackson (CMU) "An Efficient Membership-Query...

Word Count : 174

Commitment scheme

Last Update:

Marten (2013-04-01). "On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols". Journal of Cryptographic...

Word Count : 7696

PDF Search Engine © AllGlobal.net