The following pages link to Theory of Cryptography (Q5711667):
Displaying 12 items.
- Programmable hash functions and their applications (Q434345) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- (Q4373720) (← links)
- On cryptographic properties of the cosets of R(1, m) (Q4544582) (← links)
- Lossy Identification Schemes from Decisional RSA (Q5135709) (← links)
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles (Q5502754) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
