Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Computational indistinguishability
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==External links== * [[Yehuda Lindell]]. [http://u.cs.biu.ac.il/~lindell/89-656/main-89-656.html Introduction to Cryptography] * Donald Beaver and [[Silvio Micali]] and [[Phillip Rogaway]], The Round Complexity of Secure Protocols (Extended Abstract), 1990, pp. 503β513 * [[Shafi Goldwasser]] and [[Silvio Micali]]. Probabilistic Encryption. JCSS, 28(2):270β299, 1984 * [[Oded Goldreich]]. Foundations of Cryptography: Volume 2 β Basic Applications. Cambridge University Press, 2004. * [[Jonathan Katz (computer scientist)|Jonathan Katz]], [[Yehuda Lindell]], "Introduction to Modern Cryptography: Principles and Protocols," Chapman & Hall/CRC, 2007 {{PlanetMath attribution|id=3457|title=computationally indistinguishable}} [[Category:Algorithmic information theory]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)