All public logs

Combined display of all available logs of Cryptology City. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 18:16, 21 July 2024 Axhoover talk contribs created page ORAM (Redirected page to Oblivious RAM) Tag: New redirect
• 02:31, 21 July 2024 Axhoover talk contribs created page 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...")
• 01:46, 21 July 2024 Axhoover talk contribs created page Fingerprinting code (Redirected page to Fingerprinting Code) Tag: New redirect
• 18:19, 19 July 2024 Axhoover talk contribs created page PIR (Redirected page to Private Information Retrieval (PIR)) Tag: New redirect
• 18:18, 19 July 2024 Axhoover talk contribs created page Pir (Redirected page to Private Information Retrieval (PIR)) Tag: New redirect
• 18:18, 19 July 2024 Axhoover talk contribs created page 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...")
• 02:40, 5 July 2024 Axhoover talk contribs created page 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")
• 02:31, 5 July 2024 Axhoover talk contribs created page 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:13, 5 July 2024 Axhoover talk contribs created page Prp (Redirected page to Pseudorandom Permutation (PRP)) Tag: New redirect
• 02:12, 5 July 2024 Axhoover talk contribs created page PRP (Redirected page to Pseudorandom Permutation (PRP)) Tag: New redirect
• 02:12, 5 July 2024 Axhoover talk contribs created page 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:56, 5 July 2024 Axhoover talk contribs created page Iprf (Redirected page to Invertible PRF (iPRF)) Tag: New redirect
• 01:56, 5 July 2024 Axhoover talk contribs created page IPRF (Redirected page to Invertible PRF (iPRF)) Tag: New redirect
• 15:28, 4 July 2024 Axhoover talk contribs created page Primitives (Redirected page to Category:Primitives) Tag: New redirect
• 15:28, 4 July 2024 Axhoover talk contribs created page Assumptions (Redirected page to Category:Assumptions) Tag: New redirect
• 15:27, 4 July 2024 Axhoover talk contribs created page LWE (Redirected page to Learning with Errors (LWE)) Tag: New redirect
• 15:27, 4 July 2024 Axhoover talk contribs created page Lwe (Redirected page to Learning with Errors (LWE)) Tag: New redirect
• 15:26, 4 July 2024 Axhoover talk contribs created page 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}_...")
• 14:37, 4 July 2024 Axhoover talk contribs created page Category:Cryptomania (Created page with "This describes the category of primitives that exist in Imagliazzo's hypothetical Cryptomania world, where Trapdoor Permutation (TDP). If the primitive you're looking for is missing, feel free to make an account and add it!")
• 14:31, 4 July 2024 Axhoover talk contribs created page Pke (Redirected page to Public Key Encryption (PKE)) Tag: New redirect
• 14:31, 4 July 2024 Axhoover talk contribs created page PKE (Redirected page to Public Key Encryption (PKE)) Tag: New redirect
• 14:30, 4 July 2024 Axhoover talk contribs created page Public Key Encryption (PKE) (Created page with "<noinclude> Category:Primitives Category:Minicrypt A Public Key Encryption (PKE) scheme is a primitive that allows someone to publish a public key that can be used to encrypt plaintext. Then, the generator of the key can use a secret key to decrypt the ciphertext. It is a critical notion for the modern public-key infrastructure and was famously made possible by [RSA78] and [Elg85]. == Formal Definition == === Syntax ===...")
• 14:10, 4 July 2024 Axhoover talk contribs created page Se (Redirected page to Symmetric Encryption (SE)) Tag: New redirect
• 14:09, 4 July 2024 Axhoover talk contribs created page SE (Redirected page to Symmetric Encryption (SE)) Tag: New redirect
• 14:09, 4 July 2024 Axhoover talk contribs created page Symmetric Encryption (SE) (Created page with "<noinclude> Category:Primitives Category:Minicrypt A Symmetric Encryption (SE) scheme is a primitive that allows someone to encrypt plaintext into a ciphertext under a key and then to decrypt the ciphertext under the same key. It is a widely used primitive with many formal definitions of strengths. == Formal Definition == === Syntax === A Symmetric Encryption (SE) scheme is a tuple of functions <math>(\mathsf{Gen}, \mathsf{Enc}, \mathsf{Dec})</math...")
• 23:49, 3 July 2024 Axhoover talk contribs created page Category:Pre-quantum (Created page with "This describes the category of assumptions that are known to be broken by quantum computers.")
• 23:48, 3 July 2024 Axhoover talk contribs created page Category:Assumptions (Created page with "This describes the category of assumptions that are collected throughout the Cryptology City. These are the groundwork for cryptographic primitives in the real world. If the assumption you're looking for is missing, feel free to make an account and add it!")
• 21:57, 3 July 2024 Axhoover talk contribs created page Ddh (Redirected page to Decision Diffie-Hellman (DDH)) Tag: New redirect
• 21:56, 3 July 2024 Axhoover talk contribs created page DDH (Redirected page to Decision Diffie-Hellman (DDH)) Tag: New redirect
• 21:56, 3 July 2024 Axhoover talk contribs created page Decision Diffie-Hellman (DDH) (Created page with "<noinclude> Category:Assumptions Category:Pre-quantum The Decision Diffie-Hellman (DDH) assumption is a == Formal assumption == == Known attacks == * A quantum computer can compute discrete logarithms (and therefore break DDH) in any group [Sho94] * The Baby-Step-Giant-Step algorithm computes discrete logarithms in any group in <math>O(\sqrt{n})</math> time and space for groups of order <math>n</math>. (Which is known to be optimal for ge...")
• 02:06, 28 June 2024 Axhoover talk contribs created page Category:Minicrypt (Created page with "This describes the category of primitives that exist in Imagliazzo's hypothetical Minicrypt world, where One-way Function (OWF) exist but public-key cryptography does not exist. If the primitive you're looking for is missing, feel free to make an account and add it!")
• 15:40, 27 June 2024 Axhoover talk contribs created page User:Axhoover (Redirected page to Https://axhoover.com/about) Tag: New redirect
• 02:53, 27 June 2024 Axhoover talk contribs created page Contribute to Cryptology City (Created page with "Cryptology City is a large project and requires many people to work together to create something useful. One reason that it is so difficult to systematize cryptology is that there are a variety of definitions, notations, variations, and colliding terms throughout a lot of the literature. It's very easy to get confused or lost in the details. This flexibility is often useful! It allows authors to tailor their presentation for their paper, but here we want to try to b...")
• 02:39, 27 June 2024 Axhoover talk contribs created page Contributing (Created page with "# REDIRECT Contribute to Cryptology City")
• 01:58, 27 June 2024 Axhoover talk contribs created page What is Cryptology City? (add what is cryptology city)
• 23:04, 26 June 2024 Axhoover talk contribs created page Cryptology City:About (Created page with "#REDIRECT [What is Cryptology City?]")
• 23:03, 26 June 2024 Axhoover talk contribs created page Glossary (begin glossary)
• 23:02, 26 June 2024 Axhoover talk contribs created page Template:Definition (Created page with "<noinclude> Category:Templates == Template Documentation == Provides a robust way to specify a define terms in the glossary. === Example === <nowiki>{{Definition |term=efficient |defn=an algorithm which has a runtime that is bounded above by a polynomial of its input length. |link=https://mathworld.wolfram.com/PolynomialTime.html }}</nowiki> {{Definition |term=efficient |defn=an algorithm which has a runtime that is bounded above by a poly...")
• 22:35, 26 June 2024 Axhoover talk contribs created page References (Created page with "=== A === {{Reference |id=cf07 |tag=CP07 |title=On parameterized path and chordless path problems. |authors=Y. Chen and J. Flum |journal=Proceedings of the IEEE Conference on Computational Complexity 2007 |srcdetail=250-263 }} === B === === C === {{Reference |id=cdh20 |tag=CDH20 |title=A Lower Bound for One-Round Oblivious RAM |authors=D. Cash, A. Drucker, and A. Hoover |journal=TCC 2020 |link=https://eprint.iacr.org/2020/1195 }...")
• 21:49, 26 June 2024 Axhoover talk contribs created page Category:Primitives (Created page with "This describes the category of primitives that are collected throughout the [Cryptology City]. These are the building blocks for cryptographic protocols, and each have their own respective syntax and security/privacy definitions. If the primitive you're looking for is missing, feel free to make an account and add it!")
• 21:45, 26 June 2024 Axhoover talk contribs created page Primitive (Redirected page to Category:Primitives) Tag: New redirect
• 21:43, 26 June 2024 Axhoover talk contribs created page Ccref (Redirected page to References) Tag: New redirect
• 21:42, 26 June 2024 Axhoover talk contribs created page Template:Reference (Created page with "<noinclude> Category:Formatting Templates Category:Reference Templates == Template Documentation == Provides a robust way to specify a reference in the bibliography. === Example === <nowiki>{{Reference |id=cf07 |tag=CP07 |title=On parameterized path and chordless path problems. |authors=Y. Chen and J. Flum |journal=Proceedings of the IEEE Conference on Computational Complexity 2007 |srcdetail=250-263 }}</nowiki> {{Renders-As |{{R...")
• 21:38, 26 June 2024 Axhoover talk contribs created page Prf (Redirected page to Pseudorandom Function (PRF)) Tag: New redirect
• 21:37, 26 June 2024 Axhoover talk contribs created page Pseudorandom Function (PRF) (Created page with "A Pseudorandom Function (PRF) is a primitive originally defined in [cite]. TOOD: information definition == Formal Definition == === Syntax === A Pseudorandom Function (PRF) is a tuple of functions <math>(\mathsf{Gen},\mathsf{Eval})</math>, with respect to a keyspace <math>\mathcal{K}</math>, domain <math>\mathcal{D}</math>, and range <math>\mathcal{D}</math>, such that: * <math>\mathsf{Gen}(1^{\lambda}) \to k</math>, takes a security parameter, and outputs a key...")
• 21:36, 26 June 2024 Axhoover talk contribs created page PRF (Redirected page to Pseudorandom function) Tag: New redirect
• 13:07, 26 June 2024 Axhoover talk contribs deleted page Main Page (Content was unnecessary)
• 13:04, 26 June 2024 Axhoover talk contribs created page Cryptology City (add cryptology city main page)
• 12:59, 26 June 2024 Axhoover talk contribs created page MediaWiki:Mainpage (Created page with "Cryptology City")
• 03:09, 26 June 2024 Axhoover talk contribs created page Pseudorandom function (begin PRF page)