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

On the Local Leakage Resilience of Linear Secret Sharing Schemes

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

2021

Volltextzugriff (PDF)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

Journal of cryptology, 2019-04, Vol.32 (2), p.265-323

2019

Volltextzugriff (PDF)

Secure distributed key generation for discrete-log based cryptosystems

Journal of cryptology, 2007-01, Vol.20 (1), p.51-83

2007

Volltextzugriff (PDF)

Robust Non-interactive Multiparty Computation Against Constant-Size Collusion

Advances in Cryptology – CRYPTO 2017, p.391-419

Volltextzugriff (PDF)

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

Advances in Cryptology – CRYPTO 2010, p.465-482

Volltextzugriff (PDF)

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

Advances in Cryptology – CRYPTO 2010, p.98-115

Volltextzugriff (PDF)

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

Advances in Cryptology – EUROCRYPT 2010, p.135-156

Volltextzugriff (PDF)

Structure-Preserving Signatures and Commitments to Group Elements

Advances in Cryptology – CRYPTO 2010, p.209-236

Volltextzugriff (PDF)

Cryptographic Extraction and Key Derivation: The HKDF Scheme

Advances in Cryptology – CRYPTO 2010, p.631-648

Volltextzugriff (PDF)

INFORMATION-THEORETICALLY SECURE PROTOCOLS AND SECURITY UNDER COMPOSITION

SIAM journal on computing, 2010, Vol.39 (5), p.2090-2112

2010

Volltextzugriff (PDF)

On the Security of Joint Signature and Encryption

Advances in Cryptology — EUROCRYPT 2002, 2002, p.83-107

2002

Volltextzugriff (PDF)

Advances in Cryptology - CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings

Rabin, Tal

2010 edition., 2010

Volltextzugriff (PDF)

Factorization of a 768-Bit RSA Modulus

Advances in Cryptology – CRYPTO 2010, p.333-350

Volltextzugriff (PDF)

Privacy-Preserving Search of Similar Patients in Genomic Data

Proceedings on Privacy Enhancing Technologies, 2018-10, Vol.2018 (4), p.104-124

2018

Volltextzugriff (PDF)

Calibrating Noise to Sensitivity in Private Data Analysis

Lecture notes in computer science, 2006, p.265-284

2006

Volltextzugriff (PDF)

Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

Advances in Cryptology – CRYPTO 2010, p.191-208

Volltextzugriff (PDF)

Secure Computation Without Authentication

Journal of cryptology, 2011-10, Vol.24 (4), p.720-760

2011

Volltextzugriff (PDF)

The Round Complexity of Verifiable Secret Sharing Revisited

Advances in Cryptology - CRYPTO 2009, p.487-504

Volltextzugriff (PDF)

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

Advances in Cryptology – CRYPTO 2010, p.666-684

Volltextzugriff (PDF)

Improved Delegation of Computation Using Fully Homomorphic Encryption

Advances in Cryptology – CRYPTO 2010, p.483-501

Volltextzugriff (PDF)

Instantiability of RSA-OAEP under Chosen-Plaintext Attack

Advances in Cryptology – CRYPTO 2010, p.295-313

Volltextzugriff (PDF)

Secure Hash-and-Sign Signatures Without the Random Oracle

Advances in Cryptology — EUROCRYPT ’99, 1999, p.123-139

1999

Volltextzugriff (PDF)

Efficient Chosen-Ciphertext Security via Extractable Hash Proofs

Advances in Cryptology – CRYPTO 2010, p.314-332

Volltextzugriff (PDF)

An Efficient and Parallel Gaussian Sampler for Lattices

Advances in Cryptology – CRYPTO 2010, p.80-97

Volltextzugriff (PDF)

A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony

Advances in Cryptology – CRYPTO 2010, p.393-410

Volltextzugriff (PDF)

1 – 25 von 191

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(149)
Mit Volltextzugriff
(185)

Publikationsform

Sprache

Englisch
(191)
Japanisch
(1)

Erscheinungsjahr

n.n

Thema

Science & Technology
(128)
Computer Science
(127)
Technology
(121)
Computer Science, Theory & Methods
(118)
Computer Science, Information Systems
(78)
Cryptography
(58)
Exact Sciences And Technology
(56)
Applied Sciences
(55)
Telecommunications And Information Theory
(50)
Information, Signal And Communications Theory
(49)
Signal And Communications Theory
(49)
Computer Science; Control Theory; Systems
(24)
Software
(22)
Memory Organisation. Data Processing
(19)
Random Oracle
(19)
Memory And File Management
(17)
Mathematics
(16)
Hash Function
(13)
Mathematics, Applied
(13)
Physical Sciences
(13)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

On the Local Leakage Resilience of Linear Secret Sharing Schemes

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

Secure distributed key generation for discrete-log based cryptosystems

Robust Non-interactive Multiparty Computation Against Constant-Size Collusion

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

Structure-Preserving Signatures and Commitments to Group Elements

Cryptographic Extraction and Key Derivation: The HKDF Scheme

INFORMATION-THEORETICALLY SECURE PROTOCOLS AND SECURITY UNDER COMPOSITION

On the Security of Joint Signature and Encryption

Advances in Cryptology - CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings

Factorization of a 768-Bit RSA Modulus

Privacy-Preserving Search of Similar Patients in Genomic Data

Calibrating Noise to Sensitivity in Private Data Analysis

Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

Secure Computation Without Authentication

The Round Complexity of Verifiable Secret Sharing Revisited

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

Improved Delegation of Computation Using Fully Homomorphic Encryption

Instantiability of RSA-OAEP under Chosen-Plaintext Attack

Secure Hash-and-Sign Signatures Without the Random Oracle

Efficient Chosen-Ciphertext Security via Extractable Hash Proofs

An Efficient and Parallel Gaussian Sampler for Lattices

A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony

Suchergebnisse filtern