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

Attribute-based encryption for fine-grained access control of encrypted data

Conference on Computer and Communications Security: Proceedings of the 13th ACM conference on Computer and communications security; 30 Oct.-03 Nov. 2006, 2006, p.89-98

2006

Volltextzugriff (PDF)

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

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

2001

Volltextzugriff (PDF)

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003. Proceedings

2003

Volltextzugriff (PDF)

Signatures of Correct Computation

Theory of Cryptography, p.222-242

Volltextzugriff (PDF)

Efficient Coding for Interactive Communicalion

IEEE transactions on information theory, 2014-03, Vol.60 (3), p.1899

2014

Volltextzugriff (PDF)

Zero-Knowledge Proofs from Secure Multiparty Computation

SIAM journal on computing, 2009-01, Vol.39 (3), p.1121-1152

2009

Volltextzugriff (PDF)

Communication Locality in Secure Multi-party Computation: How to Run Sublinear Algorithms in a Distributed Setting

Theory of Cryptography, p.356-376

Volltextzugriff (PDF)

Coding Constructions for Blacklisting Problems without Computational Assumptions

Advances in Cryptology — CRYPTO’ 99, 1999, p.609-623

1999

Volltextzugriff (PDF)

Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings

Sahai, Amit

1, 2013

Volltextzugriff (PDF)

Self-Processing Private Sensor Data via Garbled Encryption

Proceedings on Privacy Enhancing Technologies, 2020-10, Vol.2020 (4), p.434-460

2020

Volltextzugriff (PDF)

Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization

Advances in Cryptology — CRYPTO’ 99, 1999, p.519-536

1999

Volltextzugriff (PDF)

Streaming Functional Encryption

Advances in Cryptology – CRYPTO 2023, p.433-463

Volltextzugriff (PDF)

Why “Fiat-Shamir for Proofs” Lacks a Proof

Theory of Cryptography, p.182-201

Volltextzugriff (PDF)

Identifying genetic relatives without compromising privacy

Genome research, 2014-04, Vol.24 (4), p.664-672

2014

Volltextzugriff (PDF)

On the Feasibility of Extending Oblivious Transfer

Theory of Cryptography, p.519-538

Volltextzugriff (PDF)

Round-Optimal Black-Box MPC in the Plain Model

Advances in Cryptology – CRYPTO 2023, p.393-426

Volltextzugriff (PDF)

Computational Wiretap Coding from Indistinguishability Obfuscation

Advances in Cryptology – CRYPTO 2023, p.263-293

Volltextzugriff (PDF)

Black-Box Reusable NISC with Random Oracles

Advances in Cryptology – EUROCRYPT 2023, p.68-97

Volltextzugriff (PDF)

A Counterexample to the Chain Rule for Conditional HILL Entropy: And What Deniable Encryption Has to Do with It

Theory of Cryptography, p.23-39

Volltextzugriff (PDF)

Building Hard Problems by Combining Easy Ones

2023 IEEE International Symposium on Information Theory (ISIT), 2023, p.1770-1775

2023

Volltextzugriff (PDF)

Computational Soundness of Coinductive Symbolic Security under Active Attacks

Theory of Cryptography, p.539-558

Volltextzugriff (PDF)

Secure MPC: Laziness Leads to GOD

Advances in Cryptology – ASIACRYPT 2020, p.120-150

Volltextzugriff (PDF)

ZERO-KNOWLEDGE PROOFS FROM SECURE MULTIPARTY COMPUTATION : Theory of Computing

SIAM journal on computing, 2010, Vol.39 (3), p.1121-1152

2010

Volltextzugriff (PDF)

Multiclass learning, boosting, and error-correcting codes

Annual Workshop on Computational Learning Theory: Proceedings of the twelfth annual conference on Computational learning theory; 07-09 July 1999, 1999, p.145-155

1999

Volltextzugriff (PDF)