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

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Journal of cryptology, 2021-04, Vol.34 (2), Article 11

2021

Volltextzugriff (PDF)

Garbling XOR Gates “For Free” in the Standard Model

Journal of cryptology, 2016-07, Vol.29 (3), p.552-576

Applebaum, Benny

2016

Volltextzugriff (PDF)

Key-Dependent Message Security: Generic Amplification and Completeness

Journal of cryptology, 2014, Vol.27 (3), p.429-451

Applebaum, Benny

2014

Volltextzugriff (PDF)

Obfuscating Circuits Via Composite-Order Graded Encoding

Journal of cryptology, 2021-04, Vol.34 (2), Article 14

2021

Volltextzugriff (PDF)

Cryptography in Constant Parallel Time

Applebaum, Benny

2014, 2014

Volltextzugriff (PDF)

The Communication Complexity of Private Simultaneous Messages, Revisited

Journal of cryptology, 2020-07, Vol.33 (3), p.917-953

2020

Volltextzugriff (PDF)

A Dichotomy for Local Small-Bias Generators

Journal of cryptology, 2016-07, Vol.29 (3), p.577-596

2016

Volltextzugriff (PDF)

From Private Simultaneous Messages to Zero-Information Arthur–Merlin Protocols and Back

Journal of cryptology, 2017-10, Vol.30 (4), p.961-988

2017

Volltextzugriff (PDF)

Locally Computable UOWHF with Linear Shrinkage

Journal of cryptology, 2017-07, Vol.30 (3), p.672-698

2017

Volltextzugriff (PDF)

Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

Journal of cryptology, 2018, Vol.31 (1), p.1-22

2018

Volltextzugriff (PDF)

Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions

SIAM journal on computing, 2013-01, Vol.42 (5), p.2008-2037

Applebaum, Benny

2013

Volltextzugriff (PDF)

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

SIAM journal on computing, 2023-01, Vol.52 (6), p.1321-1368

2023

Volltextzugriff (PDF)

Cryptographic Hardness of Random Local Functions

Computational complexity, 2016-09, Vol.25 (3), p.667-722

Applebaum, Benny

2016

Volltextzugriff (PDF)

Algebraic Attacks against Random Local Functions and Their Countermeasures

SIAM journal on computing, 2018-01, Vol.47 (1), p.52-79

2018

Volltextzugriff (PDF)

Cryptography with Constant Input Locality

Journal of cryptology, 2009-10, Vol.22 (4), p.429-469

2009

Volltextzugriff (PDF)

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Computational complexity, 2019-12, Vol.28 (4), p.573-616

2019

Volltextzugriff (PDF)

Perfect Secure Computation in Two Rounds

SIAM journal on computing, 2021-01, Vol.50 (1), p.68-97

2021

Volltextzugriff (PDF)

Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC

Advances in Cryptology - CRYPTO 2024, 2024, Vol.14924, p.286-320

2024

Volltextzugriff (PDF)

The Round Complexity of Statistical MPC with Optimal Resiliency

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

2023

Volltextzugriff (PDF)

Arithmetic Cryptography

Journal of the ACM, 2017-06, Vol.64 (2), p.1-74

2017

Volltextzugriff (PDF)

Better secret sharing via robust conditional disclosure of secrets

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, p.280-293

2020

Volltextzugriff (PDF)

How to Garble Arithmetic Circuits

SIAM journal on computing, 2014-01, Vol.43 (2), p.905-929

2014

Volltextzugriff (PDF)

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

SIAM journal on computing, 2021-01, Vol.50 (1), p.32-67

2021

Volltextzugriff (PDF)

On Actively-Secure Elementary MPC Reductions

Theory of Cryptography, 2021, Vol.13042, p.717-749

2021

Volltextzugriff (PDF)

Succinct Computational Secret Sharing

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

2023

Volltextzugriff (PDF)

1 – 25 von 37

Menü

Weitere Dienste

Einstellungen

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Garbling XOR Gates “For Free” in the Standard Model

Key-Dependent Message Security: Generic Amplification and Completeness

Obfuscating Circuits Via Composite-Order Graded Encoding

Cryptography in Constant Parallel Time

The Communication Complexity of Private Simultaneous Messages, Revisited

A Dichotomy for Local Small-Bias Generators

From Private Simultaneous Messages to Zero-Information Arthur–Merlin Protocols and Back

Locally Computable UOWHF with Linear Shrinkage

Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error

Cryptographic Hardness of Random Local Functions

Algebraic Attacks against Random Local Functions and Their Countermeasures

Cryptography with Constant Input Locality

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Perfect Secure Computation in Two Rounds

Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC

The Round Complexity of Statistical MPC with Optimal Resiliency

Arithmetic Cryptography

Better secret sharing via robust conditional disclosure of secrets

How to Garble Arithmetic Circuits

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

On Actively-Secure Elementary MPC Reductions

Succinct Computational Secret Sharing

Aktive Filter

Suchergebnisse filtern