Results 71 to 80 of about 4,920 (187)
Public Key Infrastructure based on Authentication of Media Attestments [PDF]
, 2013 Many users would prefer the privacy of end-to-end encryption in their online communications if it can be done without significant inconvenience. However, because existing key distribution methods cannot be fully trusted enough for automatic use, key ...
Heinrich, Stuart
core
Phase diagram and topological expansion in the complex quartic random matrix model
Communications on Pure and Applied Mathematics, Volume 77, Issue 2, Page 1405-1485, February 2024.Abstract We use the Riemann–Hilbert approach, together with string and Toda equations, to study the topological expansion in the quartic random matrix model. The coefficients of the topological expansion are generating functions for the numbers Nj(g)$\mathcal {N}_j(g)$ of 4‐valent connected graphs with j vertices on a compact Riemann surface of genus g.
Pavel Bleher +2 more
wiley +1 more source
Lower Bounds on Signatures from Symmetric Primitives [PDF]
, 2019 We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms ...
Barak, Boaz, Mahmoody, Mohammad
core +1 more source
Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP‐Hard
IET Information Security, Volume 2024, Issue 1, 2024.Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f.
Lin Wang, Guowen Xu
wiley +1 more source
On the security risk of pre-image attack on cancelable biometrics
Journal of King Saud University: Computer and Information SciencesOver the years, a number of biometric template protection schemes, often based on the notion of “cancelable biometrics”, have been proposed. An ideal cancelable biometric algorithm complies with four criteria: irreversibility, revocability, unlinkability,
Xingbo Dong +5 more
doaj +1 more source
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
IACR Transactions on Symmetric Cryptology, 2018 We provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times.
Zhenzhen Bao, Jian Guo, Lei Wang
doaj +1 more source
Improved AB‐CPREs with Revocability and HRA Security under LWE
IET Information Security, Volume 2024, Issue 1, 2024.Attribute‐based conditional proxy re‐encryption protocols (AB‐CPREs) enable a delegator to delegate his decryption rights via different policies and grant the data owner greater flexibility in allocating their encrypted private data stored in the cloud.
Yang Wang, Mingqiang Wang, Jiwei Tian
wiley +1 more source
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption [PDF]
, 2006 In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for $\mathcal{NP}$ in BPK model ...
Deng, Yi, Lin, Dongdai
core +2 more sources
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
IET Information Security, Volume 2024, Issue 1, 2024.We study quantum superposition attacks against permutation‐based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n‐bit permutation, with polynomial O(n) (or O(n2), if the concrete ...
Shaoxuan Zhang +3 more
wiley +1 more source
Lattice‐Based CP‐ABE for Optimal Broadcast Encryption With Polynomial‐Depth Circuits
IET Information Security, Volume 2024, Issue 1, 2024.Most current broadcast encryption with optimal parameters is limited to Nick’s class 1 (NC1) circuits and does not support polynomial‐depth circuits (P‐depth circuits), making it difficult to provide flexible access control in broadcast channels among vast user groups.
Shaohua Ma +4 more
wiley +1 more source