scientific article; zbMATH DE number 1962910
From MaRDI portal
Publication:4418784
zbMath1027.94013arXivcs/0212055MaRDI QIDQ4418784
No author found.
Publication date: 8 January 2004
Full work available at URL: https://arxiv.org/abs/cs/0212055
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptographypseudo-randomnesscomplexity theoryone-way functionszero knowledge interactive proofscomputational indistinguishability
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)
Related Items (2)
On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ Abstractions of non-interference security: probabilistic versus possibilistic
This page was built for publication:
