Text

Foundations of cryptography: basic techniques Volume I

---

Contents

1. Introduction
1.1 Cryptography: main topics
1.2 Some background from probability theory
1.3 The computational model
1.4 Motivation to the rigorous treatment
1.5 Miscellaneous

2. Computational difficulty
2.1 One- way functions: motivation
2.2 One-way functions: definitions
2.3 Weak one- way functions imply strong ones
2.4 One-way functions : variations
2.5 Hard-core predicates
2.6 Efficient amplification of one-way function
2.7 Miscellaneous

3. Pseudorandom generators
3.1 Motivating discussion
3.2 Computational indistinguishability
3.3 Definitions of pseudorandom generators
3.4 Construction based on one-way permutations
3.5 Constructions based on one –way functions
3.6 Pseudirandom functions
3.7 Pseudorandom permutations
3.8 Miscellaneous

4. Zero- knowledge proof systems
4.1 Zero-knowledge proofs: motivation
4.2 Interactive proof systems
4.3 Zero-knowledge proofs: definitions
4.4 Zero-knowledge proofs for NP
4.5 Negative results
4.6 Witness indistinguishability and hiding
4.7 Proofs of knowledge
4.8 Computationally sound proofs (arguments)
4.9 Constant-round zero-knowledge proofs
4.10 Non- interactive zero-knowledge proofs
4.11 Multi-prover zero-knowledge proofs
4.12 Miscellaneous
Appendix A: Background in computational number theory
Appendix B: Brief outline of volume 2

---

Availability

Detail Information

Series Title

--

Call Number

005.8 GOL f

Publisher

Cambridge : Cambridge University Press., 2004

Collation

xix, 372 hlm.; 25 cm.

Language

English

ISBN/ISSN

0521791723

Classification

005.8

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

Cryptography
Coding Theory

Specific Detail Info

--

Statement of Responsibility

Oded Goldreich

Other Information

Link

-

Daftar Isi

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment