Results 61 to 70 of about 1,098,148 (248)
Commitment and Oblivious Transfer in the Bounded Storage Model with Errors [PDF]
, 2017 The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible.
Dowsley, Rafael +2 more
core +2 more sources
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +3 more sources
IEEE Access, 2018 When executing a program or storing data in a medical Internet of Things (mIoT) system, physical side-channels analysis, such as recent-timing, cold-reboot, and virtual-machine attacks, might obtain partial information about internal sensitive medical ...
Mingwu Zhang +3 more
doaj +1 more source
Hash the Universe: Differentially Private Text Extraction with Feature Hashing
, 2022 Abstract Using artificial intelligence for text extraction can often require handling privacy-sensitive text. To avoid revealing confidential information, data owners and practitioners can use differential privacy, a definition of privacy with provable guarantees.
Sam Fletcher +2 more
openaire +1 more source
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences, 1994 The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a collection of hash functions in such a way that a random choice of a function in the class yields a low probability that any two distinct inputs will collide.
openaire +2 more sources
Medical Image Hybrid Watermark Algorithm Based on Frequency Domain Processing and Inception v3
Advanced Intelligent Systems, EarlyView.Frequency domain processing and Inceptionv3 method is used in this article for digital image watermarking of medical images. The algorithm extracts feature vectors from medical images using discrete wavelet transform and discrete cosine transform, enhancing the robustness of the image watermark With the widespread use of digital medical images in ...
Yu Fan +4 more
wiley +1 more source
Expanding the Family of Grassmannian Kernels: An Embedding Perspective
, 2014 Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks. However, it also incurs challenges arising from the fact that linear subspaces do not obey Euclidean geometry, but lie on a special type of ...
B. Kulis +10 more
core +1 more source
On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]
, 2017 Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family.
Bibak, Khodakhast +3 more
core +1 more source
Key Considerations on CITE‐Seq for Single‐Cell Multiomics
PROTEOMICS, EarlyView.ABSTRACT CITE‐Seq (Cellular Indexing of Transcriptomes and Epitopes by Sequencing) is an advanced single‐cell sequencing method to profile both gene expression and protein abundance simultaneously in individual cells using single‐cell mRNA sequencing techniques alongside antibody‐derived tags (ADTs), for protein detection.
Hye‐Wong Song +3 more
wiley +1 more source
Representation Learning for Efficient and Effective Similarity Search and Recommendation [PDF]
arXiv, 2021 How data is represented and operationalized is critical for building computational solutions that are both effective and efficient. A common approach is to represent data objects as binary vectors, denoted \textit{hash codes}, which require little storage and enable efficient similarity search through direct indexing into a hash table or through ...
arxiv