Results 81 to 90 of about 106,354 (248)
AUGURAL TERRITORIES: On the Prophetic Organizing of the Mid‐range
Abstract In this article I introduce the concept of augural territories to theorize the urbanism that emerged during pandemic lockdowns. I draw on ethnographic research in Madrid to examine how community‐based responses—including mutual aid networks, food pantries and neighbourhood associations—disrupted the spatial and temporal logics of territorial ...
Alberto Corsín Jiménez
wiley +1 more source
Provable data possession scheme with authentication
To satisfy the requirements of identity authentication and data possession proven in the cloud application scenarios,a provable data possession scheme with authentication was proposed.Based on data tag signature and randomness reusing,the proposed scheme
Hao-xing LI +3 more
doaj
A Searchable Encryption Scheme Based on CRYSTALS-Dilithium
With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks.
Minghui Zheng +3 more
doaj +1 more source
An average-case depth hierarchy theorem for Boolean circuits
We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\mathsf{AND}$, $\mathsf{OR}$, and $\mathsf{NOT}$ gates.
Rossman, Benjamin +2 more
core +1 more source
Abstract This study collects original data to examine the determinants of classification criteria of county hierarchy and its rank variations during the Tang–Song period. The results reveal that the county hierarchy was affected by both economic and political situations, with more emphasis on politics in Tang and economics in Song.
Nan Li, Heqi Cai
wiley +1 more source
On Obfuscation with Random Oracles [PDF]
Assuming trapdoor permutations, we show that there exist function families that cannot be VBB-obfuscated even if both the obfuscator and the obfuscated program have access to a random oracle. Specifically, these families are the robust unobfuscatable families of [Bitansky-Paneth, STOC 13].
Ran Canetti +2 more
openaire +1 more source
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core
The study identified key barriers to optimal patient‐centered care, including delayed diagnosis due to awareness and stigma‐related barriers among patients and caregivers, and opportunities to enhance multidisciplinary coordination. Resource limitations impacted nursing and psychosocial support, while access to support care varied across regions.
Edwin Pun Hui +10 more
wiley +1 more source
Random Oracles with(out) Programmability [PDF]
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ideal hash function. This property is interesting for at least two reasons: first, because of its seeming artificiality (no standard model hash function is known to support such
Marc Fischlin +5 more
openaire +1 more source
Von Neumann Entropy Penalization and Low Rank Matrix Estimation [PDF]
A problem of statistical estimation of a Hermitian nonnegatively definite matrix of unit trace (for instance, a density matrix in quantum state tomography) is studied.
Koltchinskii, Vladimir
core +1 more source

