scientific article; zbMATH DE number 1962910

MaRDI QIDQ4418784zbMATH OpenFDO

Authors Shafi Goldwasser

Publication date 8 January 2004

Full work available at URL https://arxiv.org/abs/cs/0212055

zbMATH Keywords

complexity theorycryptographyone-way functionspseudo-randomnesszero knowledge interactive proofscomputational indistinguishability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Complexity and Cryptography
• Some Perspectives on Complexity-Based Cryptography
• scientific article; zbMATH DE number 5081837
• scientific article; zbMATH DE number 1088226
• Foundations of Cryptography

Cited in

(7)

• Some Perspectives on Complexity-Based Cryptography
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Computational Cryptography
• scientific article; zbMATH DE number 2086704 (Why is no real title available?)
• scientific article; zbMATH DE number 1088226 (Why is no real title available?)
• scientific article; zbMATH DE number 5056805 (Why is no real title available?)
• Abstractions of non-interference security: probabilistic versus possibilistic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418784)