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

Mitigating the One-Use Restriction in Attribute-Based Encryption

Information Security and Cryptology - ICISC 2018, 2019, Vol.11396, p.23-36

2019

Volltextzugriff (PDF)

Towards a Separation of Semantic and CCA Security for Public Key Encryption

Theory of Cryptography, 2007, Vol.4392, p.434-455

2007

Volltextzugriff (PDF)

The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures

Advances in Cryptology - EUROCRYPT 2004, 2004, Vol.3027, p.306-322

2004

Volltextzugriff (PDF)

Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings

2015

Volltextzugriff (PDF)

Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions

Advances in Cryptology - CRYPTO 2024, 2024, Vol.14924, p.459-488

2024

Volltextzugriff (PDF)

XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE

Computer Security - ESORICS 2022, 2022, Vol.13554, p.217-236

2022

Volltextzugriff (PDF)

Simplified Universal Composability Framework

13th International Conference on Theory of Cryptography, TCC 2016, 2016, p.566-595

2016

Volltextzugriff (PDF)

Poly Onions: Achieving Anonymity in the Presence of Churn

Theory of Cryptography, 2022, Vol.13748, p.715-746

2022

Volltextzugriff (PDF)

Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits

Advances in Cryptology - EUROCRYPT 2016, 2016, Vol.9666, p.881-908

2016

Volltextzugriff (PDF)

Is Information-Theoretic Topology-Hiding Computation Possible?

Theory of Cryptography, 2019, Vol.11891, p.502-530

2019

Volltextzugriff (PDF)

Secure Computation for Big Data

Theory of Cryptography, 2013, Vol.7785, p.355-355

2013

Volltextzugriff (PDF)

Topology-Hiding Communication from Minimal Assumptions

Theory of Cryptography, 2020, Vol.12551, p.473-501

2020

Volltextzugriff (PDF)

Exploring the Boundaries of Topology-Hiding Computation

Advances in Cryptology - EUROCRYPT 2018, 2018, Vol.10822, p.294-325

2018

Volltextzugriff (PDF)

Hardness of Non-interactive Differential Privacy from One-Way Functions

Advances in Cryptology - CRYPTO 2018, 2018, Vol.10991, p.437-466

2018

Volltextzugriff (PDF)

Public key cryptography - PKC 2006: 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006 proceedings

2014

Volltextzugriff (PDF)

Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods

Advances in Cryptology - EUROCRYPT 2002, 2002, Vol.2332, p.400-417

2002

Volltextzugriff (PDF)

Non-Malleable Codes Against Bounded Polynomial Time Tampering

Advances in Cryptology - EUROCRYPT 2019, 2019, Vol.11476, p.501-530

2019

Volltextzugriff (PDF)

Applied Cryptography and Network Security: 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers

1st ed. 2015, 2015

Volltextzugriff (PDF)

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

Advances in Cryptology - CRYPTO 2018, 2018, Vol.10993, p.731-752

2018

Volltextzugriff (PDF)

Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation

Security and Cryptography for Networks, 2018, Vol.11035, p.407-424

2018

Volltextzugriff (PDF)

Non-malleability Against Polynomial Tampering

Advances in Cryptology - CRYPTO 2020, 2020, Vol.12172, p.97-126

2020

Volltextzugriff (PDF)

Efficient Communication-Storage Tradeoffs for Multicast Encryption

Advances in Cryptology - EUROCRYPT '99, 1999, Vol.1592, p.459-474

1999

Volltextzugriff (PDF)

Reputation Systems for Anonymous Networks

Privacy Enhancing Technologies, 2008, Vol.5134, p.202-218

2008

Volltextzugriff (PDF)

Public-Key Function-Private Hidden Vector Encryption (and More)

Advances in Cryptology - ASIACRYPT 2019, 2019, Vol.11923, p.489-519

2019

Volltextzugriff (PDF)

Single Database Private Information Retrieval Implies Oblivious Transfer

Advances in Cryptology - EUROCRYPT 2000, 2000, Vol.1807, p.122-138

2000

Volltextzugriff (PDF)

1 – 25 von 50

Suche als RSS-Feed

Aktive Filter

ThemaComputer Security

KollektioneBooks on EBSCOhost

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(31)
Mit Volltextzugriff
(50)

Publikationsform

Sprache

Englisch
(50)

Erscheinungsjahr

n.n

Kollektion

Ebook Central Perpetual and DDA
(50)
Ingenta
(30)
Springer Book Series (Lecture Notes)
(30)
IngentaConnect Journals
(1)

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Mitigating the One-Use Restriction in Attribute-Based Encryption

Towards a Separation of Semantic and CCA Security for Public Key Encryption

The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures

Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings

Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions

XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE

Simplified Universal Composability Framework

Poly Onions: Achieving Anonymity in the Presence of Churn

Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits

Is Information-Theoretic Topology-Hiding Computation Possible?

Secure Computation for Big Data

Topology-Hiding Communication from Minimal Assumptions

Exploring the Boundaries of Topology-Hiding Computation

Hardness of Non-interactive Differential Privacy from One-Way Functions

Public key cryptography - PKC 2006: 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006 proceedings

Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods

Non-Malleable Codes Against Bounded Polynomial Time Tampering

Applied Cryptography and Network Security: 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation

Non-malleability Against Polynomial Tampering

Efficient Communication-Storage Tradeoffs for Multicast Encryption

Reputation Systems for Anonymous Networks

Public-Key Function-Private Hidden Vector Encryption (and More)

Single Database Private Information Retrieval Implies Oblivious Transfer

Aktive Filter

Suchergebnisse filtern