UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Foundations of Cryptography – A Primer

Foundations and trends in theoretical computer science, 2005, Vol.1 (1), p.1-116

Goldreich, Oded

2005

Volltextzugriff (PDF)

Improved bounds on the AN-complexity of O(1)-linear functions

Computational complexity, 2022, Vol.31 (2), Article 7

Goldreich, Oded

2022

Volltextzugriff (PDF)

Probabilistic Proof Systems: A Primer

Foundations and trends in theoretical computer science, 2008, Vol.3 (1), p.1-91

Goldreich, Oded

2008

Volltextzugriff (PDF)

Good permutation codes based on the shuffle-exchange network

Israel journal of mathematics, 2023-09, Vol.256 (1), p.283-296

2023

Volltextzugriff (PDF)

A Lower Bound on the Complexity of Testing Grained Distributions

Computational complexity, 2023-12, Vol.32 (2), Article 11

2023

Volltextzugriff (PDF)

On the (Im)possibility of Obfuscating Programs

Journal of the ACM, 2012-04, Vol.59 (2), p.1-48

2012

Volltextzugriff (PDF)

Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, p.1-5

Goldreich, Oded

Volltextzugriff (PDF)

On Doubly-Efficient Interactive Proof Systems

Foundations and trends in theoretical computer science, 2018, Vol.13 (3), p.157-246

Goldreich, Oded

2018

Volltextzugriff (PDF)

The random oracle methodology, revisited

Journal of the ACM, 2004-07, Vol.51 (4), p.557-594

2004

Volltextzugriff (PDF)

Testing Distributions of Huge Objects

TheoretiCS, 2023-12, Vol.2

2023

Volltextzugriff (PDF)

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

TheoretiCS, 2022-12, Vol.1

2022

Volltextzugriff (PDF)

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, p.406-421

Goldreich, Oded

Volltextzugriff (PDF)

Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation

1st ed. 2020., 2020

Volltextzugriff (PDF)

On the (im)possibility of obfuscating programs : (Extended abstract)

Lecture notes in computer science, 2001, p.1-18

2001

Volltextzugriff (PDF)

Enhancements of Trapdoor Permutations

Journal of cryptology, 2013-07, Vol.26 (3), p.484-512

2013

Volltextzugriff (PDF)

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

Journal of cryptology, 2013-01, Vol.26 (1), p.39-74

2013

Volltextzugriff (PDF)

Software protection and simulation on oblivious RAMs

Journal of the ACM, 1996-05, Vol.43 (3), p.431-473

1996

Volltextzugriff (PDF)

Private information retrieval

Journal of the ACM, 1998-11, Vol.45 (6), p.965-981

1998

Volltextzugriff (PDF)

Property testing and its connection to learning and approximation

Journal of the ACM, 1998-07, Vol.45 (4), p.653-750

1998

Volltextzugriff (PDF)

On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions

Computational Complexity and Property Testing, 2020, Vol.12050, p.41-86

2020

Volltextzugriff (PDF)

The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution

Computational Complexity and Property Testing, 2020, Vol.12050, p.152-172

Goldreich, Oded

2020

Volltextzugriff (PDF)

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP

Theoretical computer science, 2021-07, Vol.878-879, p.83-101

2021

Volltextzugriff (PDF)

Worst-Case to Average-Case Reductions for Subclasses of P

Computational Complexity and Property Testing, 2020, Vol.12050, p.249-295

2020

Volltextzugriff (PDF)

On (Valiant's) Polynomial-Size Monotone Formula for Majority

Computational Complexity and Property Testing, 2020, Vol.12050, p.17-23

Goldreich, Oded

2020

Volltextzugriff (PDF)

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Computational Complexity and Property Testing, 2020, Vol.12050, p.87-118

Goldreich, Oded

2020

Volltextzugriff (PDF)

1 – 25 von 438

Menü

Weitere Dienste

Einstellungen

Foundations of Cryptography – A Primer

Improved bounds on the AN-complexity of O(1)-linear functions

Probabilistic Proof Systems: A Primer

Good permutation codes based on the shuffle-exchange network

A Lower Bound on the Complexity of Testing Grained Distributions

On the (Im)possibility of Obfuscating Programs

Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard

On Doubly-Efficient Interactive Proof Systems

The random oracle methodology, revisited

Testing Distributions of Huge Objects

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

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

Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation

On the (im)possibility of obfuscating programs : (Extended abstract)

Enhancements of Trapdoor Permutations

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

Software protection and simulation on oblivious RAMs

Private information retrieval

Property testing and its connection to learning and approximation

On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions

The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP

Worst-Case to Average-Case Reductions for Subclasses of P

On (Valiant's) Polynomial-Size Monotone Formula for Majority

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Suchergebnisse filtern