Results 81 to 90 of about 75,202 (312)
Irish Mathematical Society Bulletin, 1988 This short survey article reviews progress in asymmetric (or public-key) cryptography. Knapsack methods are described along with the successful attacks by Shamir and others. The RSA method and certain generalisations are also considered.
openaire +2 more sources
PBSFL: Privacy-Preserving and Byzantine-Resilient for Summoning Federated Learning
Journal of King Saud University: Computer and Information SciencesWith the expansion of large-scale model applications, a typical division-of-labor federated learning (FL) training paradigm has emerged. This scenario is defined as Summoned Federated Learning (SFL), in which a single task initiator mobilizes cloud ...
Bowei Chen, Yan Ke, Wei Zhang, Jia Liu
doaj +1 more source
Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices [PDF]
, 2011 Networks are evolving toward a ubiquitous model in which heterogeneous devices are interconnected. Cryptographic algorithms are required for developing security solutions that protect network activity. However, the computational and energy limitations
Herrera-Joancomartí, Jordi +4 more
core +1 more source
The Logic of Large Enough [PDF]
, 2010 In this paper we explore the "for large enough" quantifier, also known as "all but finitely many", which plays a central role in asymptotic reasoning, as used for example in complexity theory and cryptography.
Eerke Boiten +3 more
core +1 more source
Optimal colored threshold visual cryptography schemes [PDF]
, 2005 Visual cryptography schemes allow the encoding of a secret image into n shares which are distributed to the participants. The shares are such that only qualified subsets of participants can visually recover the secret image.
A. De Santis, S. Cimato, R. De Prisco
core +2 more sources
High-Chroma Visual Cryptography Using Interference Color of High-Order Retarder Films [PDF]
, 2015 Visual cryptography can be used as a method of sharing a secret image through several encrypted images. Conventional visual cryptography can display only monochrome images.
Sugawara, Shiori +2 more
core +1 more source
Journal of King Saud University: Computer and Information SciencesMultimodal sarcasm detection aims to identify ironic intent from textual and visual information, with the core challenge lying in capturing semantic inconsistencies between different modalities.
Yaxuan Wang +4 more
doaj +1 more source
Liver organoids: modelling complexity in homeostasis and disease
FEBS Letters, EarlyView.Studying liver in vitro has been challenging because simple 2D cell cultures fail to capture liver's cellular and architectural complexity. To bridge this gap, scientists increasingly use organoids, 3D liver models which better mimic liver composition and function. This review examines recent advances in liver organoid complexity and realism, discusses
Anna M. Dowbaj, Meritxell Huch
wiley +1 more source
Cheating in visual cryptography
, 2014 A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret.
Chen, T. +3 more
core +1 more source
Efficient algorithms for pairing-based cryptosystems [PDF]
, 2002 We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain ...
B. Lynn +13 more
core +1 more source