scientific article
From MaRDI portal
Publication:3972530
zbMath0792.68045MaRDI QIDQ3972530
Martín Abadi, Andrei Z. Broder, Hemaspaandra, Lane A., Joan Feigenbaum, Eric W. Allender
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
oracleSATNPcryptographically secure one-way functionsinvulnerable generatorstest data for heuristic algorithmszero- knowledge proof systems
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Practical proofs of knowledge without relying on theoretical proofs of membership on languages, On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes, On the complexity of ranking, On sets polynomially enumerable by iteration, On the theory of average case complexity, On the effective generation of set elements within specified ranges
