UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 354

Sortiert nach

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings

Advances in Cryptology – CRYPTO 2018, p.597-627

Volltextzugriff (PDF)

Practical Homomorphic Message Authenticators for Arithmetic Circuits

Journal of cryptology, 2018-01, Vol.31 (1), p.23-59

2018

Volltextzugriff (PDF)

Efficiently Verifiable Computation on Encrypted Data

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014, p.844-855

2014

Volltextzugriff (PDF)

Practical Homomorphic MACs for Arithmetic Circuits

Advances in Cryptology – EUROCRYPT 2013, p.336-352

Volltextzugriff (PDF)

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015, p.1518-1529

2015

Volltextzugriff (PDF)

Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions

Journal of cryptology, 2014-07, Vol.27 (3), p.544-593

2014

Volltextzugriff (PDF)

Spin-orbital Jahn-Teller bipolarons

Nature communications, 2024-03, Vol.15 (1), p.2429-9, Article 2429

2024

Volltextzugriff (PDF)

Zero-knowledge proofs for set membership: efficient, succinct, modular

Designs, codes, and cryptography, 2023-11, Vol.91 (11), p.3457-3525

2023

Volltextzugriff (PDF)

Efficient Network Coding Signatures in the Standard Model

Public Key Cryptography – PKC 2012, p.680-696

Volltextzugriff (PDF)

On the (In)Security of SNARKs in the Presence of Oracles

Theory of Cryptography, p.108-138

Volltextzugriff (PDF)

Automated Analysis of Cryptographic Assumptions in Generic Group Models

Journal of cryptology, 2019-04, Vol.32 (2), p.324-360

2019

Volltextzugriff (PDF)

Verifiable Random Functions from Identity-Based Key Encapsulation

Advances in Cryptology - EUROCRYPT 2009, 2009, p.554-571

2009

Volltextzugriff (PDF)

Modeling magnetic multipolar phases in density functional theory

Physical review. B, 2022-07, Vol.106 (3), Article 035127

2022

Volltextzugriff (PDF)

Making the Diffie-Hellman Protocol Identity-Based

Topics in Cryptology - CT-RSA 2010, p.165-178

Volltextzugriff (PDF)

Doping Evolution of the Local Electronic and Structural Properties of the Double Perovskite Ba2Na1–xCaxOsO6

Journal of physical chemistry. C, 2020-07, Vol.124 (30), p.16577-16585

2020

Volltextzugriff (PDF)

Interplay between multipolar spin interactions, Jahn-Teller effect, and electronic correlation in a Jeff = 32 insulator

Physical review. B, 2021-03, Vol.103 (10), p.1

2021

Volltextzugriff (PDF)

Publicly verifiable delegation of large polynomials and matrix computations, with applications

Proceedings of the 2012 ACM conference on Computer and communications security, 2012, p.501-512

2012

Volltextzugriff (PDF)

Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds

Public-Key Cryptography -- PKC 2015, p.355-376

Volltextzugriff (PDF)

Interactive Encryption and Message Authentication

Security and Cryptography for Networks, p.494-513

Volltextzugriff (PDF)

Automated Analysis of Cryptographic Assumptions in Generic Group Models

Advances in Cryptology – CRYPTO 2014, p.95-112

Volltextzugriff (PDF)

Ferro-octupolar Order and Low-Energy Excitations in d^{2} Double Perovskites of Osmium

Physical review letters, 2021-12, Vol.127 (23), p.237201-237201

2021

Volltextzugriff (PDF)

Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, p.1067-1080

2022

Volltextzugriff (PDF)

Vector Commitments and Their Applications

Public-Key Cryptography – PKC 2013, p.55-72

Volltextzugriff (PDF)

Verifiable delegation of computation on outsourced data

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, 2013, p.863-874

2013

Volltextzugriff (PDF)

LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019, p.2075-2092

2019

Volltextzugriff (PDF)

1 – 25 von 354

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(321)
Mit Volltextzugriff
(340)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(270)
Life Sciences & Biomedicine
(168)
Humans
(92)
Technology
(85)
Computer Science
(67)
Surgery
(63)
Oncology
(56)
Computer Science, Theory & Methods
(55)
Physical Sciences
(49)
Female
(46)
Male
(44)
Computer Science, Information Systems
(39)
Medicine
(39)
Middle Aged
(39)
Medicine & Public Health
(38)
Patients
(34)
Retrospective Studies
(33)
Adult
(32)
Aged
(31)
Sarcoma
(31)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

Menü

Weitere Dienste

Einstellungen

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings

Practical Homomorphic Message Authenticators for Arithmetic Circuits

Efficiently Verifiable Computation on Encrypted Data

Practical Homomorphic MACs for Arithmetic Circuits

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data

Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions

Spin-orbital Jahn-Teller bipolarons

Zero-knowledge proofs for set membership: efficient, succinct, modular

Efficient Network Coding Signatures in the Standard Model

On the (In)Security of SNARKs in the Presence of Oracles

Automated Analysis of Cryptographic Assumptions in Generic Group Models

Verifiable Random Functions from Identity-Based Key Encapsulation

Modeling magnetic multipolar phases in density functional theory

Making the Diffie-Hellman Protocol Identity-Based

Doping Evolution of the Local Electronic and Structural Properties of the Double Perovskite Ba2Na1–xCaxOsO6

Interplay between multipolar spin interactions, Jahn-Teller effect, and electronic correlation in a Jeff = 32 insulator

Publicly verifiable delegation of large polynomials and matrix computations, with applications

Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds

Interactive Encryption and Message Authentication

Automated Analysis of Cryptographic Assumptions in Generic Group Models

Ferro-octupolar Order and Low-Energy Excitations in d^{2} Double Perovskites of Osmium

Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams

Vector Commitments and Their Applications

Verifiable delegation of computation on outsourced data

LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs

Suchergebnisse filtern