# Category:Theory of cryptography

Here is a list of articles in the category **Theory of cryptography** of the Computing portal that unifies foundations of mathematics and computations using computers. **Theory of cryptography** refers to the study of cryptographic algorithms and protocols in a formal framework. The two main goals of the study are definitions and proofs of security.

## Pages in category "Theory of cryptography"

The following 68 pages are in this category, out of 68 total.

### A

- Advantage (cryptography)
*(computing)* - Averaging argument
*(computing)*

### B

- Bent function
*(computing)* - Burrows–Abadi–Needham logic
*(computing)*

### C

- Chaos communications
*(computing)* - Chaos machine
*(computing)* - Ciphertext indistinguishability
*(computing)* - Claw-free permutation
*(computing)* - Collision resistance
*(computing)* - Common reference string model
*(computing)* - Computational hardness assumption
*(computing)* - Concrete security
*(computing)*

### D

- Decorrelation theory
*(computing)* - Deterministic encryption
*(computing)* - Differential equations of addition
*(computing)* - Differential privacy
*(computing)* - Differential Privacy
*(computing)* - Distribution ensemble
*(computing)* - Dual basis in a field extension
*(computing)*

### E

- Exponential mechanism (differential privacy)
*(computing)*

### F

- Fiat–Shamir heuristic
*(computing)* - Full Domain Hash
*(computing)*

### G

- Garbled circuit
*(computing)* - Generic group model
*(computing)* - Group-based cryptography
*(computing)*

### H

- HAIFA construction
*(computing)* - Hard-core predicate
*(computing)* - Horton Principle
*(computing)*

### I

- Information-theoretic security
*(computing)*

### K

- KR advantage
*(computing)*

### L

- Lattice reduction
*(computing)* - Leftover hash lemma
*(computing)* - Lenstra–Lenstra–Lovász lattice basis reduction algorithm
*(computing)* - Local differential privacy
*(computing)*

### M

- Mask generation function
*(computing)* - Message authentication
*(computing)*

### N

- Neural cryptography
*(computing)* - Non-interactive zero-knowledge proof
*(computing)*

### P

- Phi-hiding assumption
*(computing)* - Plaintext-aware encryption
*(computing)* - Polynomial basis
*(computing)* - PR-CPA advantage
*(computing)* - PRF advantage
*(computing)* - Privacy-preserving computational geometry
*(computing)* - Private information retrieval
*(computing)* - Probabilistic encryption
*(computing)* - Provable security
*(computing)* - Pseudo-Hadamard transform
*(computing)* - Pseudorandom function family
*(computing)* - Pseudorandom permutation
*(computing)*

### Q

- Quadratic residuosity problem
*(computing)*

### R

- Rabin fingerprint
*(computing)* - Random oracle
*(computing)* - Reconstruction attack
*(computing)*

### S

- Safe prime
*(computing)* - Secure multi-party computation
*(computing)* - Semantic security
*(computing)* - Semiprime
*(computing)* - Socialist millionaire problem
*(computing)* - Socialist millionaires
*(computing)* - Sponge function
*(computing)* - Standard model (cryptography)
*(computing)* - Strong prime
*(computing)*

### T

- Trapdoor function
*(computing)*

### U

- Universal composability
*(computing)*

### W

- Witness-indistinguishable proof
*(computing)*

### Y

- Yao's Millionaires' Problem
*(computing)*

### Z

- Zero-knowledge proof
*(computing)*