Find link

language:

Find link is a tool written by Edward Betts.

searching for Random oracle 18 found (83 total)

Chosen-ciphertext attack (1,105 words) [view diff] exact match in snippet view article find links to article

chosen-ciphertext attack, including (among others) RSA-OAEP secure under the random oracle heuristics, Cramer-Shoup which was the first public key practical system

Group signature (1,058 words) [view diff] exact match in snippet view article find links to article

signature (around 200 bytes). The security of the scheme is proven in the random oracle model and relies on the Strong Diffie Hellman assumption (SDH) and a

SPEKE (1,005 words) [view diff] exact match in snippet view article find links to article

B-SPEKE. A paper published by MacKenzie in 2001 presents a proof in the random oracle model that SPEKE is a secure PAKE protocol (using a somewhat relaxed

P/poly (1,867 words) [view diff] exact match in snippet view article find links to article

the center of many attempts to prove P ≠ NP. It is known that for a random oracle A, NPA is not a subset of PA/poly with probability 1. P/poly is also

Bernstein–Vazirani algorithm (1,225 words) [view diff] exact match in snippet view article find links to article

accomplished with a recursive construction and the inclusion of a second, random oracle. The resulting decision problem is solvable by a QTM with O ( n ) {\displaystyle

Hit Song Science (600 words) [view diff] exact match in snippet view article find links to article

al. has shown that audio features can indeed be used to outperform a random oracle when predicting top 10 versus top 30-40 hits. A technology proposing

IP (complexity) (5,591 words) [view diff] exact match in snippet view article

of the ACM 39.4 (1992): 869-877. Chang Richard; et al. (1994). "The random oracle hypothesis is false". Journal of Computer and System Sciences. 49 (1):

Machtey Award (179 words) [view diff] case mismatch in snippet view article find links to article

Ilango (MIT) "SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle" 2022 Robert Andrews (UIUC) "On Matrix Multiplication and Polynomial

BLAKE (hash function) (2,859 words) [view diff] exact match in snippet view article

of SHA-3: immunity to length extension, indifferentiability from a random oracle, etc. BLAKE2 removes addition of constants to message words from BLAKE

Peta Lily (687 words) [view diff] case mismatch in snippet view article find links to article

was commissioned by the Unity Theatre, Liverpool, to write and direct Random Oracle (2001). The dynamic poems included the script of Chastity Belt are currently

Digital signature (5,315 words) [view diff] exact match in snippet view article find links to article

that leads to that value, which does not lead to an attack. In the random oracle model, hash-then-sign (an idealized version of that practice where hash

C. Pandu Rangan (1,223 words) [view diff] case mismatch in snippet view article find links to article

Chandrasekaran Pandu Rangan: Constant Size Ring Signature Without Random Oracle. Information Security and Privacy - 20th Australasian Conference, ACISP

Center for Research on Computation and Society (852 words) [view diff] case mismatch in snippet view article find links to article

Mohammad; Moran, Tal; Vadhan, Salil (2011). "Time-Lock Puzzles in the Random Oracle Model". In Rogaway, Phillip (ed.). Advances in Cryptology – CRYPTO 2011

Naor–Reingold pseudorandom function (1,975 words) [view diff] exact match in snippet view article find links to article

polynomial time, even if an attacker performs polynomially many queries to a random oracle.https://en.wikipedia.org/wiki/Elliptic_curve Decisional Diffie–Hellman

NIST SP 800-90A (1,979 words) [view diff] exact match in snippet view article find links to article

generation and reseeding, which have not been analyzed at all before. Under random oracle model and assuming an oracle-independent entropy source: Hash_DBRG is

Time-lock puzzle (353 words) [view diff] exact match in snippet view article find links to article

Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. "Time-lock puzzles in the random oracle model." In Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology

Oblivious data structure (1,344 words) [view diff] exact match in snippet view article find links to article

RAM: Let RAM(m) denote a RAM with m memory locations and access to a random oracle machine. Then t steps of an arbitrary RAM(m) program can be simulated

Oblivious RAM (3,993 words) [view diff] exact match in snippet view article find links to article

worst-case computational overheads are. The constructions of were in the random oracle model, where the client assumes access to an oracle that behaves like