Theory of Cryptography
From MaRDI portal
Publication:5901789
DOI10.1007/b95566zbMath1197.94203OpenAlexW2498336418MaRDI QIDQ5901789
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95566
Related Items
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol ⋮ Pseudo-free families and cryptographic primitives ⋮ On the rational subset problem for groups. ⋮ Pseudo-free families of finite computational elementary abelian \(p\)-groups ⋮ The RSA group is pseudo-free ⋮ Pseudo-free families of computational universal algebras ⋮ Statistically Hiding Sets ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption