scientific article; zbMATH DE number 1962910

zbMATH Open1027.94013arXivcs/0212055MaRDI QIDQ4418784FDOQ4418784

Authors: Shafi Goldwasser 

Publication date: 8 January 2004

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• Some Perspectives on Complexity-Based Cryptography
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Computational Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)