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

Must the Communication Graph of MPC Protocols be an Expander?

Journal of cryptology, 2023-07, Vol.36 (3), Article 20

2023

Volltextzugriff (PDF)

Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Journal of cryptology, 2008-04, Vol.21 (2), p.149-177

2008

Volltextzugriff (PDF)

Breaking the O(n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

Journal of cryptology, 2024, Vol.37 (1), Article 2

2024

Volltextzugriff (PDF)

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

Journal of cryptology, 2014, Vol.27 (4), p.824-849

2014

Volltextzugriff (PDF)

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience

Journal of cryptology, 2023-04, Vol.36 (2), Article 13

2023

Volltextzugriff (PDF)

Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication

Journal of cryptology, 2008-07, Vol.21 (3), p.392-429

2008

Volltextzugriff (PDF)

Adaptively Secure MPC with Sublinear Communication Complexity

Journal of cryptology, 2023-04, Vol.36 (2), Article 11

2023

Volltextzugriff (PDF)

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Journal of cryptology, 2015-10, Vol.28 (4), p.820-843

2015

Volltextzugriff (PDF)

Secure Integration of Asymmetric and Symmetric Encryption Schemes

Journal of cryptology, 2013-01, Vol.26 (1), p.80-101

2013

Volltextzugriff (PDF)

A Taxonomy of Pairing-Friendly Elliptic Curves

Journal of cryptology, 2010-04, Vol.23 (2), p.224-280

2010

Volltextzugriff (PDF)

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

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

2021

Volltextzugriff (PDF)

Efficient Cache Attacks on AES, and Countermeasures

Journal of cryptology, 2010-01, Vol.23 (1), p.37-71

2010

Volltextzugriff (PDF)

FlipIt: The Game of “Stealthy Takeover”

Journal of cryptology, 2013-10, Vol.26 (4), p.655-713

2013

Volltextzugriff (PDF)

A Proof of Security of Yao’s Protocol for Two-Party Computation

Journal of cryptology, 2009-04, Vol.22 (2), p.161-188

2009

Volltextzugriff (PDF)

Compact Proofs of Retrievability

Journal of cryptology, 2013-07, Vol.26 (3), p.442-483

2013

Volltextzugriff (PDF)

Secure Proxy Signature Schemes for Delegation of Signing Rights

Journal of cryptology, 2012, Vol.25 (1), p.57-115

2012

Volltextzugriff (PDF)

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Journal of cryptology, 2013-04, Vol.26 (2), p.191-224

2013

Volltextzugriff (PDF)

Tweakable Block Ciphers

Journal of cryptology, 2011-07, Vol.24 (3), p.588-613

2011

Volltextzugriff (PDF)

Match Me if You Can: Matchmaking Encryption and Its Applications

Journal of cryptology, 2021-07, Vol.34 (3), Article 16

2021

Volltextzugriff (PDF)

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Journal of cryptology, 2008-07, Vol.21 (3), p.350-391

2008

Volltextzugriff (PDF)

Logic Minimization Techniques with Applications to Cryptology

Journal of cryptology, 2013-04, Vol.26 (2), p.280-312

2013

Volltextzugriff (PDF)

Batch Verification of Short Signatures

Journal of cryptology, 2012-10, Vol.25 (4), p.723-747

2012

Volltextzugriff (PDF)

Quark: A Lightweight Hash

Journal of cryptology, 2013-04, Vol.26 (2), p.313-339

2013

Volltextzugriff (PDF)

MPClan: Protocol Suite for Privacy-Conscious Computations

Journal of cryptology, 2023-07, Vol.36 (3), Article 22

2023

Volltextzugriff (PDF)

Semi-quantum Money

Journal of cryptology, 2022-04, Vol.35 (2), Article 8

2022

Volltextzugriff (PDF)

1 – 25 von 666

Menü

Weitere Dienste

Einstellungen

Must the Communication Graph of MPC Protocols be an Expander?

Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Breaking the O(n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

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

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience

Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication

Adaptively Secure MPC with Sublinear Communication Complexity

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Secure Integration of Asymmetric and Symmetric Encryption Schemes

A Taxonomy of Pairing-Friendly Elliptic Curves

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe

Efficient Cache Attacks on AES, and Countermeasures

FlipIt: The Game of “Stealthy Takeover”

A Proof of Security of Yao’s Protocol for Two-Party Computation

Compact Proofs of Retrievability

Secure Proxy Signature Schemes for Delegation of Signing Rights

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Tweakable Block Ciphers

Match Me if You Can: Matchmaking Encryption and Its Applications

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Logic Minimization Techniques with Applications to Cryptology

Batch Verification of Short Signatures

Quark: A Lightweight Hash

MPClan: Protocol Suite for Privacy-Conscious Computations

Semi-quantum Money

Aktive Filter

Suchergebnisse filtern