Results 81 to 90 of about 11,450 (279)

Security of discrete log cryptosystems in the random oracle and the generic model

open access: yes, 1999
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  

AUGURAL TERRITORIES: On the Prophetic Organizing of the Mid‐range

open access: yesInternational Journal of Urban and Regional Research, EarlyView.
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

Strongly Secure Certificateless Authenticated Key Agreement Protocol in Standard Model

open access: yes工程科学与技术, 2013
:Based on Zhang’s security model, an improved pairing-free certificateless key agreement,CL-AKA random oracle model, was proposed. An ephemeral-secret query and three types of fresh oracles were further defined in the improved CL-AKA random oracle model ...
张延红, 陈明
doaj  

Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]

open access: yesQuantum
Copy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo   +2 more
doaj   +1 more source

Not all Temperature Shocks are Alike: Disentangling Heat and High Temperature Shocks and Their Effects on Inflation in Australia

open access: yesEconomic Record, EarlyView.
We study the effects of heat and high temperature shocks on inflation in Australia using monthly, state‐level temperature anomaly data via two stages. In the first stage, we decompose temperature anomalies into orthogonal components using a structural vector autoregression with long‐run restrictions.
Tan Dat Huynh, Mengheng Li
wiley   +1 more source

Cryptanalysis of a Lightweight Certificateless Signature Scheme for IIOT Environments

open access: yesIEEE Access, 2018
As an extremely significant cryptographic primitive, certificateless signature (CLS) schemes can provide message authentication with no use of traditional digital certificates.
Bo Zhang   +3 more
doaj   +1 more source

The Random Oracle Methodology, Revisited

open access: yes, 1998
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called \cryptographic hash functions".
Ran Canetti, Shai Halevi, Oded Goldreich
core  

Constant Size Ring Signature Without Random Oracle [PDF]

open access: yes, 2015
Ring signature enables an user to anonymously sign a message on behalf of a group of users termed as ‘ring’ formed in an ‘ad-hoc’ manner. A naive scheme produces a signature linear in the size of the ring, but this is extremely inefficient when ring size
C. Pandu Rangan   +2 more
core  

From politics to economics: The investigation of the determinants of local administrative hierarchy in the Tang–Song transition

open access: yesAsia‐Pacific Economic History Review, Volume 65, Issue 1, Page 39-78, March 2025.
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

Universally Composable Sigma-protocols in the Global Random-Oracle Model

open access: yes, 2022
Numerous cryptographic applications require efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoK) as a building block. Typically they rely on the Fiat-Shamir heuristic to do so, as security in the random-oracle model is considered good ...
Anna Lysyanskaya, Leah Namisa Rosenbloom
core  

Home - About - Disclaimer - Privacy