User contributions for Axhoover
Jump to navigation
Jump to search
25 July 2024
- 02:1902:19, 25 July 2024 diff hist +4 Oblivious RAM (ORAM) →Syntax current
22 July 2024
- 21:2821:28, 22 July 2024 diff hist +488 Oblivious RAM (ORAM) →Formal Definition
- 21:1021:10, 22 July 2024 diff hist +7 Oram Changed redirect target from Oblivious RAM to Oblivious RAM (ORAM) current Tag: Redirect target changed
- 21:1021:10, 22 July 2024 diff hist +7 ORAM Changed redirect target from Oblivious RAM to Oblivious RAM (ORAM) current Tag: Redirect target changed
21 July 2024
- 18:5818:58, 21 July 2024 diff hist +122 N Category:Unconditional Created page with "This describes the category of primitives that exist unconditionally and do not rely on any cryptographic assumptions." current
- 18:5618:56, 21 July 2024 diff hist +3,212 N Oblivious RAM (ORAM) Created page with "<noinclude> Category:Primitives Category:Unconditional Category:Minicrypt Oblivious RAM (ORAM) was first introduced by [GO96]. It is a primitive that provides a generic compilation of any random-access memory (RAM) program to one which hides the accesses pattern of the underlying RAM. '''Note:''' Oblivious RAM schemes can provide statistical or unconditional security against adveraries who only know which array indices are accessed. H..."
- 18:2918:29, 21 July 2024 diff hist +222 References →L current
- 18:1718:17, 21 July 2024 diff hist +34 N Oblivious RAM Redirected page to Oblivious RAM (ORAM) current Tag: New redirect
- 18:1618:16, 21 July 2024 diff hist +27 N Oram Redirected page to Oblivious RAM Tag: New redirect
- 18:1618:16, 21 July 2024 diff hist +27 N ORAM Redirected page to Oblivious RAM Tag: New redirect
- 02:3302:33, 21 July 2024 diff hist +6 Fingerprinting Code →Correctness current
- 02:3102:31, 21 July 2024 diff hist +3,760 N Fingerprinting Code Created page with "<noinclude> Category:Primitives Category:Unconditional Fingerprinting Codes were first introduced by [BS98]. A Fingerprinting Code is describes a process to produce codewords for users. If a group of these users collude to adversarially produce a new codeword, then a fingerprinting code guarantees that the distributor can trace the new word back to these colluders with high probability. == Formal Definition == For fingerprinting codes..."
- 02:1202:12, 21 July 2024 diff hist +270 References No edit summary
- 01:4601:46, 21 July 2024 diff hist +33 N Fingerprinting code Redirected page to Fingerprinting Code current Tag: New redirect
- 01:3701:37, 21 July 2024 diff hist +338 References No edit summary
19 July 2024
- 18:2118:21, 19 July 2024 diff hist +63 Private Information Retrieval (PIR) No edit summary current
- 18:1918:19, 19 July 2024 diff hist +49 N PIR Redirected page to Private Information Retrieval (PIR) current Tag: New redirect
- 18:1818:18, 19 July 2024 diff hist +49 N Pir Redirected page to Private Information Retrieval (PIR) current Tag: New redirect
- 18:1818:18, 19 July 2024 diff hist +3,459 N Private Information Retrieval (PIR) Created page with "<noinclude> Category:Primitives Category:Unconditional A Private Information Retrieval (PIR) is a primitive that allows a client to access a specific element from a public array without revealing which array element was accessed. This primitive was originally defined in [CGKS98]. It is sometimes referred to as ''statistical'' PIR, because this article describes the unconditional primitive, which is based on no computational assumption. S..."
- 17:3217:32, 19 July 2024 diff hist +246 References No edit summary
5 July 2024
- 02:4002:40, 5 July 2024 diff hist −2 Pseudorandom Permutation (PRP) →Variations current
- 02:4002:40, 5 July 2024 diff hist +238 N MediaWiki:Sidebar Created page with " * navigation ** mainpage|mainpage-description ** Category:Primitives|Primitives ** Category:Assumptions|Assumptions ** recentchanges-url|recentchanges ** randompage-url|randompage ** helppage|help-mediawiki * SEARCH * TOOLBOX * LANGUAGES" current
- 02:3702:37, 5 July 2024 diff hist +316 Public Key Encryption (PKE) →Formal Definition current
- 02:3702:37, 5 July 2024 diff hist +7 Symmetric Encryption (SE) →Correctness current
- 02:3602:36, 5 July 2024 diff hist +296 Symmetric Encryption (SE) →Formal Definition
- 02:3202:32, 5 July 2024 diff hist +3 Pseudorandom Function (PRF) No edit summary current
- 02:3102:31, 5 July 2024 diff hist +2,621 N Pseudorandom Permutation (PRP) Created page with "<noinclude> Category:Primitives Category:Minicrypt A Pseudorandom Permutation (PRP) is a basic primitive which allows someone to succinctly sample and represent a permutation which appears to be uniformly randomly selected. The user, who generates the key, can evaluate the permutation over some domain both forward and backward efficiently. These pseudorandom permutations are also the primitive which represents block ciphers, such as https://en.wikipedi..."
- 02:2802:28, 5 July 2024 diff hist +240 Invertible PRF (iPRF) →Formal Definition current
- 02:1302:13, 5 July 2024 diff hist +44 N Prp Redirected page to Pseudorandom Permutation (PRP) current Tag: New redirect
- 02:1202:12, 5 July 2024 diff hist +44 N PRP Redirected page to Pseudorandom Permutation (PRP) current Tag: New redirect
- 02:1202:12, 5 July 2024 diff hist +3,001 N Invertible PRF (iPRF) Created page with "<noinclude> Category:Primitives Category:Minicrypt An Invertible Pseudorandom Function (iPRF) is a strengthening of the traditional Pseudorandom Function (PRF). An iPRF allows a user to succinctly represent and evaluate a function that is indistinguishable from a random function, but also to invert the random function! A user generates a key, which it can use to evaluate a function both forward and backward. This introduces a..."
- 01:5601:56, 5 July 2024 diff hist +35 N Iprf Redirected page to Invertible PRF (iPRF) current Tag: New redirect
- 01:5601:56, 5 July 2024 diff hist +35 N IPRF Redirected page to Invertible PRF (iPRF) current Tag: New redirect
- 01:5501:55, 5 July 2024 diff hist +7 Pseudorandom Function (PRF) No edit summary
4 July 2024
- 15:4115:41, 4 July 2024 diff hist 0 Contribute to Cryptology City No edit summary current
- 15:4115:41, 4 July 2024 diff hist −25 Learning with Errors (LWE) No edit summary current
- 15:4015:40, 4 July 2024 diff hist −6 Learning with Errors (LWE) →Formal assumption
- 15:3915:39, 4 July 2024 diff hist +16 Learning with Errors (LWE) No edit summary
- 15:3815:38, 4 July 2024 diff hist +18 Learning with Errors (LWE) No edit summary
- 15:3315:33, 4 July 2024 diff hist +6 Learning with Errors (LWE) No edit summary
- 15:3315:33, 4 July 2024 diff hist +54 Learning with Errors (LWE) →Formal assumption
- 15:3115:31, 4 July 2024 diff hist +15 Cryptology City →Introduction current
- 15:2915:29, 4 July 2024 diff hist −7 Cryptology City →Getting started
- 15:2815:28, 4 July 2024 diff hist +33 N Primitives Redirected page to Category:Primitives current Tag: New redirect
- 15:2815:28, 4 July 2024 diff hist +34 N Assumptions Redirected page to Category:Assumptions current Tag: New redirect
- 15:2715:27, 4 July 2024 diff hist +40 N LWE Redirected page to Learning with Errors (LWE) current Tag: New redirect
- 15:2715:27, 4 July 2024 diff hist +40 N Lwe Redirected page to Learning with Errors (LWE) current Tag: New redirect
- 15:2615:26, 4 July 2024 diff hist +2,855 N Learning with Errors (LWE) Created page with "<noinclude> Category:Assumptions Category:Pre-quantum The Learning with Errors (LWE) assumption is a common assumption, first introduced in [Reg05]. It has been used since to construct a wide variety of powerful primitives. == Parameters == The LWE assumption has 4 key parameters: * <math>q</math> - the prime modulus * <math>n</math> - the dimension of the secret vector * <math>\eta</math> - the noise distribution over <math>\mathbb{Z}_..."
- 15:1915:19, 4 July 2024 diff hist +8 Decision Diffie-Hellman (DDH) No edit summary current
- 15:0215:02, 4 July 2024 diff hist +4 Contribute to Cryptology City No edit summary