UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...

Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation

IEEE transactions on dependable and secure computing, 2019-03, Vol.16 (2), p.217-230

2019

Link zum Volltext
Volltext

High performance logistic regression for privacy-preserving genome analysis

BMC medical genomics, 2021-01, Vol.14 (1), p.23-23, Article 23

2021

Link zum Volltext

Verfügbarkeit prüfen

Information-theoretically secure oblivious polynomial evaluation in the commodity-based model

International journal of information security, 2015-02, Vol.14 (1), p.73-84

2015

Link zum Volltext

Verfügbarkeit prüfen

Information Security: 19th International Conference, ISC 2016, Honolulu, HI, USA, September 3-6, 2016. Proceedings

1st Edition 2016, 2016

Link zum Volltext

Verfügbarkeit prüfen

Weakly Supervised Deep Learning for the Detection of Domain Generation Algorithms

IEEE access, 2019, Vol.7, p.51542-51556

2019

Link zum Volltext

Verfügbarkeit prüfen

On the Composability of Statistically Secure Random Oblivious Transfer

Entropy (Basel, Switzerland), 2020-01, Vol.22 (1), p.107

2020

Link zum Volltext

Verfügbarkeit prüfen

Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

IEEE access, 2021, Vol.9, p.139928-139945

2021

Link zum Volltext

Verfügbarkeit prüfen

A CCA2 Secure Variant of the McEliece Cryptosystem

IEEE transactions on information theory, 2012-10, Vol.58 (10), p.6672-6680

2012

Link zum Volltext
Volltext

Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra

IEEE transactions on information forensics and security, 2016-01, Vol.11 (1), p.59-73

2016

Link zum Volltext
Volltext

Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model

IEEE transactions on information theory, 2011-08, Vol.57 (8), p.5566-5571

2011

Link zum Volltext
Volltext

On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability

IEEE transactions on information theory, 2017-10, Vol.63 (10), p.6819-6826

2017

Link zum Volltext
Volltext

Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

IEEE transactions on information theory, 2018-08, Vol.64 (8), p.5970-5984

2018

Link zum Volltext
Volltext

Protecting Privacy of Users in Brain-Computer Interface Applications

IEEE transactions on neural systems and rehabilitation engineering, 2019-08, Vol.27 (8), p.1546

2019

Link zum Volltext

Verfügbarkeit prüfen

Commitment Capacity of Discrete Memoryless Channels

Cryptography and Coding, 2003, p.35-51

2003

Link zum Volltext

Verfügbarkeit prüfen

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols

Provable Security, p.354-367

Link zum Volltext

Verfügbarkeit prüfen

On the Oblivious-Transfer Capacity of Noisy Resources

IEEE transactions on information theory, 2008-06, Vol.54 (6), p.2572-2581

2008

Link zum Volltext
Volltext

Information Theoretic Security: 9th International Conference, ICITS 2016, Tacoma, WA, USA, August 9-12, 2016, Revised Selected Papers

1, 2016

Link zum Volltext

Verfügbarkeit prüfen

IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

Advances in Cryptology – ASIACRYPT 2012, p.485-503

Link zum Volltext

Verfügbarkeit prüfen

Public-Key Encryption Schemes with Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions

Computer journal, 2015-10, Vol.58 (10), p.2738-2746

2015

Link zum Volltext

Verfügbarkeit prüfen

The Commitment Capacity of the Gaussian Channel Is Infinite

IEEE transactions on information theory, 2008-06, Vol.54 (6), p.2785-2789

2008

Link zum Volltext
Volltext

On the Commitment Capacity of Unfair Noisy Channels

IEEE transactions on information theory, 2020-06, Vol.66 (6), p.3745-3752

2020

Link zum Volltext
Volltext

Fast Privacy-Preserving Text Classification Based on Secure Multiparty Computation

IEEE transactions on information forensics and security, 2022, Vol.17, p.428-442

2022

Link zum Volltext
Volltext

Clustering Analysis of Email Malware Campaigns

2021 IEEE International Conference on Cyber Security and Resilience (CSR), 2021, p.95-102

2021

Link zum Volltext

Verfügbarkeit prüfen

Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions

Information Security and Privacy, 2004, p.62-73

2004

Link zum Volltext

Verfügbarkeit prüfen

Bit String Commitment Reductions with a Non-zero Rate

Lecture notes in computer science, 2004, p.179-193

2004

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 229

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(141)
Mit Volltextzugriff
(218)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(131)
Computer Security
(64)
Life Sciences & Biomedicine
(56)
Technology
(56)
Computer Science
(41)
Cryptography
(29)
Physical Sciences
(29)
Data Encryption
(28)
Computer Science, Information Systems
(26)
Coding Theory & Cryptology
(25)
Computer Science, Theory & Methods
(25)
Engineering
(24)
Engineering, Electrical & Electronic
(21)
Animals
(17)
Humans
(17)
Protocols
(15)
Applied Sciences
(12)
Exact Sciences And Technology
(12)
Oblivious Transfer
(12)
Chemistry
(11)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation

High performance logistic regression for privacy-preserving genome analysis

Information-theoretically secure oblivious polynomial evaluation in the commodity-based model

Information Security: 19th International Conference, ISC 2016, Honolulu, HI, USA, September 3-6, 2016. Proceedings

Weakly Supervised Deep Learning for the Detection of Domain Generation Algorithms

On the Composability of Statistically Secure Random Oblivious Transfer

Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

A CCA2 Secure Variant of the McEliece Cryptosystem

Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra

Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model

On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability

Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

Protecting Privacy of Users in Brain-Computer Interface Applications

Commitment Capacity of Discrete Memoryless Channels

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols

On the Oblivious-Transfer Capacity of Noisy Resources

Information Theoretic Security: 9th International Conference, ICITS 2016, Tacoma, WA, USA, August 9-12, 2016, Revised Selected Papers

IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

Public-Key Encryption Schemes with Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions

The Commitment Capacity of the Gaussian Channel Is Infinite

On the Commitment Capacity of Unfair Noisy Channels

Fast Privacy-Preserving Text Classification Based on Secure Multiparty Computation

Clustering Analysis of Email Malware Campaigns

Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions

Bit String Commitment Reductions with a Non-zero Rate

Suchergebnisse filtern