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

More Efficient Two-Round Multi-Signature Scheme with Provably Secure Parameters for Standardized Elliptic Curves

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2024-07, Vol.E107.A (7), p.966-988, Article 2023EAP1045

2024

Volltextzugriff (PDF)

Efficient Card-Based Cryptographic Protocols for Millionaires’ Problem Utilizing Private Permutations

Cryptology and Network Security, p.500-517

Volltextzugriff (PDF)

How to Solve Millionaires’ Problem with Two Kinds of Cards

New generation computing, 2021-04, Vol.39 (1), p.73-96

2021

Volltextzugriff (PDF)

A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2023-03, Vol.E106.A (3), p.315-324, Article 2022CIP0021

2023

Volltextzugriff (PDF)

Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations

New generation computing, 2022, Vol.40 (1), p.95-113

2022

Volltextzugriff (PDF)

Efficient Card-Based Majority Voting Protocols

New generation computing, 2022-03, Vol.40 (1), p.173-198

2022

Volltextzugriff (PDF)

Achieving Pairing-Free Aggregate Signatures using Pre-Communication between Signers

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2021-09, Vol.E104.A (9), p.1188-1205, Article 2020DMP0023

2021

Volltextzugriff (PDF)

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2022-12, Vol.E105.A (12), p.1559-1577, Article 2021EAP1163

2022

Volltextzugriff (PDF)

Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2019-09, Vol.E102.A (9), p.1079-1090

2019

Volltextzugriff (PDF)

An IC-level countermeasure against laser fault injection attack by information leakage sensing based on laser-induced opto-electric bulk current density

Japanese Journal of Applied Physics, 2020-04, Vol.59 (SG), p.SGGL02

2020

Volltextzugriff (PDF)

Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2019-09, Vol.E102.A (9), p.1101-1117

2019

Volltextzugriff (PDF)

New Fault-Based Side-Channel Attack Using Fault Sensitivity

IEEE transactions on information forensics and security, 2012-02, Vol.7 (1), p.88-97

2012

Volltextzugriff (PDF)

Information-Theoretic Approach to Optimal Differential Fault Analysis

IEEE transactions on information forensics and security, 2012-02, Vol.7 (1), p.109-120

2012

Volltextzugriff (PDF)

Probabilistic Generation of Trapdoors: Reducing Information Leakage of Searchable Symmetric Encryption

Cryptology and Network Security, p.350-364

Volltextzugriff (PDF)

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum

Progress in Cryptology – AFRICACRYPT 2014, p.285-299

Volltextzugriff (PDF)

On the Power of Fault Sensitivity Analysis and Collision Side-Channel Attacks in a Combined Setting

Cryptographic Hardware and Embedded Systems – CHES 2011, p.292-311

Volltextzugriff (PDF)

Single-Round Pattern Matching Key Generation Using Physically Unclonable Function

Security and communication networks, 2019, Vol.2019 (2019), p.1-13

2019

Volltextzugriff (PDF)

On the Security of Dynamic Group Signatures: Preventing Signature Hijacking

Public Key Cryptography – PKC 2012, p.715-732

Volltextzugriff (PDF)

Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

Public Key Cryptography – PKC 2007, p.343-360

Volltextzugriff (PDF)

Fair and Consistent Hardware Evaluation of Fourteen Round Two SHA-3 Candidates

IEEE transactions on very large scale integration (VLSI) systems, 2012-05, Vol.20 (5), p.827-840

2012

Volltextzugriff (PDF)

A limitation on security evaluation of cryptographic primitives with fixed keys

Security and communication networks, 2016-08, Vol.9 (12), p.1663-1675

2016

Volltextzugriff (PDF)

Toward the Fair Anonymous Signatures: Deniable Ring Signatures

Lecture notes in computer science, 2006, p.174-191

2006

Volltextzugriff (PDF)

A New Type of Fault-Based Attack: Fault Behavior Analysis

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2013, Vol.E96.A (1), p.177-184

2013

Volltextzugriff (PDF)

Toward Effective Countermeasures against an Improved Fault Sensitivity Analysis

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2012, Vol.E95-A (1), p.234-241

2012

Volltextzugriff (PDF)

Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack

Topics in Cryptology – CT-RSA 2008, p.1-18

Volltextzugriff (PDF)

1 – 25 von 1.371

Suche als RSS-Feed

Aktive Filter

KollektioneBooks on EBSCOhost

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(930)
Mit Volltextzugriff
(1.106)

Publikationsform

Sprache

Englisch
(1.145)
Japanisch
(283)
Koreanisch
(1)

Erscheinungsjahr

n.n

Thema

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

More Efficient Two-Round Multi-Signature Scheme with Provably Secure Parameters for Standardized Elliptic Curves

Efficient Card-Based Cryptographic Protocols for Millionaires’ Problem Utilizing Private Permutations

How to Solve Millionaires’ Problem with Two Kinds of Cards

A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model

Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations

Efficient Card-Based Majority Voting Protocols

Achieving Pairing-Free Aggregate Signatures using Pre-Communication between Signers

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited

Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing

An IC-level countermeasure against laser fault injection attack by information leakage sensing based on laser-induced opto-electric bulk current density

Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology

New Fault-Based Side-Channel Attack Using Fault Sensitivity

Information-Theoretic Approach to Optimal Differential Fault Analysis

Probabilistic Generation of Trapdoors: Reducing Information Leakage of Searchable Symmetric Encryption

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum

On the Power of Fault Sensitivity Analysis and Collision Side-Channel Attacks in a Combined Setting

Single-Round Pattern Matching Key Generation Using Physically Unclonable Function

On the Security of Dynamic Group Signatures: Preventing Signature Hijacking

Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

Fair and Consistent Hardware Evaluation of Fourteen Round Two SHA-3 Candidates

A limitation on security evaluation of cryptographic primitives with fixed keys

Toward the Fair Anonymous Signatures: Deniable Ring Signatures

A New Type of Fault-Based Attack: Fault Behavior Analysis

Toward Effective Countermeasures against an Improved Fault Sensitivity Analysis

Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack

Aktive Filter

Suchergebnisse filtern