Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642226694, 9783642226700

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_28 ◽

2011 ◽

pp. 406-421 ◽

Cited By ~ 16

Author(s):

Oded Goldreich

Keyword(s):

State Of The Art ◽

The State ◽

Zero Knowledge ◽

Trapdoor Permutations

Download Full-text

On the Circuit Complexity of Perfect Hashing

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_4 ◽

2011 ◽

pp. 26-29

Author(s):

Oded Goldreich ◽

Avi Wigderson

Keyword(s):

Circuit Complexity ◽

Perfect Hashing

Download Full-text

Introduction to Testing Graph Properties

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_32 ◽

2011 ◽

pp. 470-506 ◽

Cited By ~ 4

Author(s):

Oded Goldreich

Keyword(s):

Graph Properties

Download Full-text

On Constructing 1-1 One-Way Functions

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_3 ◽

2011 ◽

pp. 13-25 ◽

Cited By ~ 5

Author(s):

Oded Goldreich ◽

Leonid A. Levin ◽

Noam Nisan

Download Full-text

On Testing Expansion in Bounded-Degree Graphs

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_9 ◽

2011 ◽

pp. 68-75 ◽

Cited By ~ 9

Author(s):

Oded Goldreich ◽

Dana Ron

Keyword(s):

Bounded Degree ◽

Bounded Degree Graphs

Download Full-text

On the Complexity of Computational Problems Regarding Distributions

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_27 ◽

2011 ◽

pp. 390-405 ◽

Cited By ~ 3

Author(s):

Oded Goldreich ◽

Salil Vadhan

Download Full-text

On the Average-Case Complexity of Property Testing

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_15 ◽

2011 ◽

pp. 124-135

Author(s):

Oded Goldreich

Keyword(s):

Property Testing ◽

Average Case ◽

Case Complexity ◽

Average Case Complexity

Download Full-text

On Security Preserving Reductions – Revised Terminology

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_34 ◽

2011 ◽

pp. 540-546 ◽

Cited By ~ 2

Author(s):

Oded Goldreich

Download Full-text

Bravely, Moderately: A Common Theme in Four Recent Works

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_26 ◽

2011 ◽

pp. 373-389 ◽

Cited By ~ 2

Author(s):

Oded Goldreich

Keyword(s):

Common Theme

Download Full-text

From Logarithmic Advice to Single-Bit Advice

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22670-0_13 ◽

2011 ◽

pp. 109-113 ◽

Cited By ~ 1

Author(s):

Oded Goldreich ◽

Madhu Sudan ◽

Luca Trevisan

Download Full-text

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art

On the Circuit Complexity of Perfect Hashing

Introduction to Testing Graph Properties

On Constructing 1-1 One-Way Functions

On Testing Expansion in Bounded-Degree Graphs

On the Complexity of Computational Problems Regarding Distributions

On the Average-Case Complexity of Property Testing

On Security Preserving Reductions – Revised Terminology

Bravely, Moderately: A Common Theme in Four Recent Works

From Logarithmic Advice to Single-Bit Advice

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - Lecture Notes in Computer Science
Latest Publications