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...

Pseudorandomness

Foundations and trends in theoretical computer science, 2012, Vol.7 (1–3), p.1-336

Vadhan, Salil P.

2012

Volltextzugriff (PDF)

PCPs and the Hardness of Generating Synthetic Data

Journal of cryptology, 2020-10, Vol.33 (4), p.2078-2112

2020

Volltextzugriff (PDF)

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

Journal of the ACM, 2009-06, Vol.56 (4), p.1-34

2009

Volltextzugriff (PDF)

On the (Im)possibility of Obfuscating Programs

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

2012

Volltextzugriff (PDF)

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs

Algorithmica, 2024-10, Vol.86 (10), p.3153-3185

2024

Volltextzugriff (PDF)

Differential Privacy on Finite Computers

The journal of privacy and confidentiality, 2019-10, Vol.9 (2)

2019

Volltextzugriff (PDF)

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions

Journal of cryptology, 2018-10, Vol.31 (4), p.1012-1063

2018

Volltextzugriff (PDF)

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

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

2001

Volltextzugriff (PDF)

Notions of Reducibility between Cryptographic Primitives

Lecture notes in computer science, 2004, p.1-20

2004

Volltextzugriff (PDF)

Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions

SIAM journal on computing, 2013-01, Vol.42 (3), p.1405-1430

2013

Volltextzugriff (PDF)

Constructing locally computable extractors and cryptosystems in the bounded-storage model

Journal of cryptology, 2004-12, Vol.17 (1), p.43-77

VADHAN, Salil P

2004

Volltextzugriff (PDF)

Canonical noise distributions and private hypothesis tests

The Annals of statistics, 2023-04, Vol.51 (2), p.547

2023

Volltextzugriff (PDF)

Deterministic extractors for small-space sources

Journal of computer and system sciences, 2011, Vol.77 (1), p.191-220

2011

Volltextzugriff (PDF)

A complete problem for statistical zero knowledge

Journal of the ACM, 2003-03, Vol.50 (2), p.196-249

2003

Volltextzugriff (PDF)

Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions

Advances in Cryptology – EUROCRYPT 2013, p.93-110

Volltextzugriff (PDF)

Conjunctive, Subset, and Range Queries on Encrypted Data

Theory of Cryptography, p.535-554

Volltextzugriff (PDF)

An Unconditional Study of Computational Zero Knowledge

SIAM journal on computing, 2006-01, Vol.36 (4), p.1160-1214

Vadhan, Salil P.

2006

Volltextzugriff (PDF)

Fingerprinting Codes and the Price of Approximate Differential Privacy

SIAM journal on computing, 2018-01, Vol.47 (5), p.1888-1938

2018

Volltextzugriff (PDF)

A standardised differential privacy framework for epidemiological modeling with mobile phone data

PLOS digital health, 2023-10, Vol.2 (10), p.e0000233-e0000233

2023

Volltextzugriff (PDF)

Randomization and Approximation Techniques in Computer Science: 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings

1, 2002

Volltextzugriff (PDF)

The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM journal on computing, 2001, Vol.31 (2), p.398-427

Vadhan, Salil P.

2001

Volltextzugriff (PDF)

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

SIAM journal on computing, 2009-01, Vol.39 (3), p.1153-1218

2009

Volltextzugriff (PDF)

Concurrent Composition of Differential Privacy

Theory of Cryptography, 2021, p.582-604

2021

Volltextzugriff (PDF)

Concurrent Composition Theorems for Differential Privacy

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.507-519

2023

Volltextzugriff (PDF)

Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

Journal of computer and system sciences, 2002-08, Vol.65 (1), p.97-128

2002

Volltextzugriff (PDF)

1 – 25 von 278

Menü

Weitere Dienste

Einstellungen

Pseudorandomness

PCPs and the Hardness of Generating Synthetic Data

Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

On the (Im)possibility of Obfuscating Programs

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs

Differential Privacy on Finite Computers

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions

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

Notions of Reducibility between Cryptographic Primitives

Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions

Constructing locally computable extractors and cryptosystems in the bounded-storage model

Canonical noise distributions and private hypothesis tests

Deterministic extractors for small-space sources

A complete problem for statistical zero knowledge

Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions

Conjunctive, Subset, and Range Queries on Encrypted Data

An Unconditional Study of Computational Zero Knowledge

Fingerprinting Codes and the Price of Approximate Differential Privacy

A standardised differential privacy framework for epidemiological modeling with mobile phone data

Randomization and Approximation Techniques in Computer Science: 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings

The Complexity of Counting in Sparse, Regular, and Planar Graphs

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

Concurrent Composition of Differential Privacy

Concurrent Composition Theorems for Differential Privacy

Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

Suchergebnisse filtern