Results 81 to 90 of about 384,292 (296)

Cryptanalysis of a Pairing-free Certificateless Signcryption scheme

open access: yesICT Express, 2021
Signcryption is a very useful cryptographic primitive that aims to achieve authentication and confidentiality in an efficient manner. We cryptanalyze the signcryption scheme of Wei and Ma (2019) which is claimed to be secure.
Philemon Kasyoka   +2 more
doaj  

A new Definition and Classification of Physical Unclonable Functions

open access: yes, 2015
A new definition of "Physical Unclonable Functions" (PUFs), the first one that fully captures its intuitive idea among experts, is presented. A PUF is an information-storage system with a security mechanism that is 1. meant to impede the duplication of
Merli, Dominik, Plaga, Rainer
core   +1 more source

Protecting against Cryptographic Trojans in FPGAs

open access: yes2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines, 2015
In contrast to ASICs, hardware Trojans can potentially be injected into FPGA designs post-manufacturing by bit stream alteration. Hardware Trojans which target cryptographic primitives are particularly interesting for an adversary because a weakened ...
Pawel Swierczynski   +4 more
semanticscholar   +1 more source

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead

open access: yesIACR Cryptology ePrint Archive, 2020
Secure aggregation is a cryptographic primitive that enables a server to learn the sum of the vector inputs of many clients. Bonawitz et al. (CCS 2017) presented a construction that incurs computation and communication for each client linear in the ...
James Bell   +4 more
semanticscholar   +1 more source

DP-Cryptography: Marrying Differential Privacy and Cryptography in Emerging Applications [PDF]

open access: yesarXiv, 2020
Differential privacy (DP) has arisen as the state-of-the-art metric for quantifying individual privacy when sensitive data are analyzed, and it is starting to see practical deployment in organizations such as the US Census Bureau, Apple, Google, etc. There are two popular models for deploying differential privacy - standard differential privacy (SDP ...
arxiv  

Implementing TLS with Verified Cryptographic Security

open access: yesIEEE Symposium on Security and Privacy, 2013
TLS is possibly the most used protocol for secure communications, with a 18-year history of flaws and fixes, ranging from its protocol logic to its cryptographic design, and from the Internet standard to its diverse implementations. We develop a verified
K. Bhargavan   +4 more
semanticscholar   +1 more source

On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 3, Page 109-122, March 2025.
ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia   +3 more
wiley   +1 more source

THE TABULAR OF CRYPTOGRAPHIC PRIMITIVES OF NONLINEAR SUBSTITUTIONS

open access: yesÌнформаційні технології в освіті, 2015
Classic primitives nonlinear substitution is a simple replacing each character encrypted text on a fixed symbol of the same alphabet, actually realizing the transformation one alphabet simple substitution cipher. And as a consequence - the entropy cipher
A. Beletsky
doaj  

A Novel Identity-Based Signcryption Scheme in the Standard Model

open access: yesInformation, 2017
Identity-based signcryption is a useful cryptographic primitive that provides both authentication and confidentiality for identity-based crypto systems. It is challenging to build a secure identity-based signcryption scheme that can be proven secure in a
Yueying Huang, Junjie Yang
doaj   +1 more source

Universal one-way hash functions and their cryptographic applications

open access: yesSymposium on the Theory of Computing, 1989
We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x.
M. Naor, M. Yung
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy