Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Oxford University Press (OUP)  (6)
  • Mathematics  (6)
  • 1
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2018
    In:  The Computer Journal Vol. 61, No. 9 ( 2018-09-01), p. 1329-1337
    In: The Computer Journal, Oxford University Press (OUP), Vol. 61, No. 9 ( 2018-09-01), p. 1329-1337
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2018
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal ( 2023-06-02)
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-06-02)
    Abstract: Stealth address is a known technique to ensure the privacy (anonymity) of a recipient participating in a certain transaction in a distributed blockchain scenario. However, most existing stealth address schemes require linear judge time and search time $\mathcal{O}(n)$, where $n$ is the number of transactions of a certain block, so the only way to claim transactions for a recipient is to traverse the transaction list to find out whether an ever-arrived transaction belongs to him. To overcome this drawback, we proposed the notion of Fast Stealth Address (FSA), a novel approach that simultaneously preserves privacy and improves search efficiency of recipients. We give a generic construction of FSA scheme under subgroup membership assumption related to factoring and instantiate concrete schemes based on specific number-theoretic assumptions. Our framework mainly improves on two aspects: (i) allowing constant recognize time $\mathcal{O}(1)$ to judge whether a certain block contains recipient’s transactions and (ii) allowing logarithmic search time $\mathcal{O}(\log{n})$ to find out the precise transactions intended for a recipient. We formalize the security model of an FSA scheme and provide provable security analysis to ensure the security of our constructions. Besides, we implement our schemes to measure their real-world performance on several metrics and give comparison results to stealth address scheme utilized by Monero.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 10 ( 2020-10-19), p. 1597-1606
    In: The Computer Journal, Oxford University Press (OUP), Vol. 63, No. 10 ( 2020-10-19), p. 1597-1606
    Abstract: A general framework to investigate the interference and coverage probability is proposed in this paper for indoor terahertz (THz) communications with beamforming antennas. Due to the multipath effects of THz band (0.1–10 THz), the line of sight and non-line of sight interference from users and access points (APs) (both equipped with beamforming antennas) are separately analyzed based on distance-dependent probability functions. Moreover, to evaluate the effects of obstacles in real applications, a Poisson distribution blockage model is implemented. Moreover, the coverage probability is derived by means of signal to interference plus noise ratio (SINR). Numerical results are conducted to present the interference and coverage probability with different parameters, including the indoor area size, SINR threshold, numbers of interfering users and APs and half-power bandwidth of beamforming antenna.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2020
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2018
    In:  Journal of the Royal Statistical Society Series C: Applied Statistics Vol. 67, No. 2 ( 2018-02-01), p. 307-327
    In: Journal of the Royal Statistical Society Series C: Applied Statistics, Oxford University Press (OUP), Vol. 67, No. 2 ( 2018-02-01), p. 307-327
    Abstract: Environmental epidemiologists are often interested in estimating the effect of functions of time varying exposure histories, such as the 12-month moving average, in relation to chronic disease incidence or mortality. The individual exposure measurements that comprise such an exposure history are usually mismeasured, at least moderately, and, often, more substantially. To obtain unbiased estimates of Cox model hazard ratios for these complex mismeasured exposure functions, an extended risk set regression calibration method for Cox models is developed and applied to a study of long-term exposure to the fine particulate matter, PM2.5, component of air pollution in relation to all-cause mortality in the nurses’ health study. Simulation studies under several realistic assumptions about the measurement error model and about the correlation structure of the repeated exposure measurements were conducted to assess the finite sample properties of this new method and found that the method has good performance in terms of finite sample bias reduction and nominal confidence interval coverage.
    Type of Medium: Online Resource
    ISSN: 0035-9254 , 1467-9876
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2018
    detail.hit.zdb_id: 204797-4
    detail.hit.zdb_id: 1482300-7
    detail.hit.zdb_id: 1476894-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2014
    In:  Journal of the Royal Statistical Society Series C: Applied Statistics Vol. 63, No. 3 ( 2014-04-01), p. 467-482
    In: Journal of the Royal Statistical Society Series C: Applied Statistics, Oxford University Press (OUP), Vol. 63, No. 3 ( 2014-04-01), p. 467-482
    Abstract: The paper considers data from an aphid infestation on a sugar cane plantation and illustrates the use of an individual level infectious disease model for making inference on the biological process underlying these data. The data are interval censored, and the practical issues involved with the use of Markov chain Monte Carlo algorithms with models of this sort are explored and developed. As inference for spatial infectious disease models is complex and computationally demanding, emphasis is put on a minimal parsimonious model and speed of code execution. With careful coding we can obtain highly efficient Markov chain Monte Carlo algorithms based on a simple random-walk Metropolis-within-Gibbs routine. An assessment of model fit is provided by comparing the predicted numbers of weekly infections from the data to the trajectories of epidemics simulated from the posterior distributions of model parameters. This assessment shows that the data have periods where the epidemic proceeds more slowly and more quickly than the (temporally homogeneous) model predicts.
    Type of Medium: Online Resource
    ISSN: 0035-9254 , 1467-9876
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2014
    detail.hit.zdb_id: 204797-4
    detail.hit.zdb_id: 1482300-7
    detail.hit.zdb_id: 1476894-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 4 ( 2022-04-19), p. 1020-1028
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 4 ( 2022-04-19), p. 1020-1028
    Abstract: Homomorphic message authentication codes (MACs) allow a user to outsource data to an untrusted server and verify the correctness of returned computation results over the outsourced data. Many cloud applications need delegation computations over outsourced data with dual capabilities. On one hand, they need to keep the outsourced data secret such that the server cannot trace and infer any sensitive information from the computation results. On the other hand, the user should be able to efficiently verify the computation results. Unfortunately, the state-of-the-art homomorphic MAC schemes are not so desirable due to either poor privacy or low verification efficiency. In this paper, we first put forward a new cryptographic primitive called privacy-preserving homomorphic MACs (PHMAC) that simultaneously provides data privacy and efficient verification. Then, we present a PHMAC construction capable for the evaluation of polynomials of fixed degree $d\geq 1$, in which the tag does not reveal any information of underlying authenticated data while being verifiable in constant time (in an amortized sense). As an application, we give a generic construction of homomorphic authenticated encryption (HAE) from proposed PHMAC and homomorphic encryption. Benefited from the functionalities of underlying PHMAC scheme, the derived HAE enjoys stronger authenticity and supports larger classes of functions than that of Lai et al. (Verifiable Computation on Outsourced Encrypted Data. In Computer Security—ESORICS 2014—19th European Symposium on Research in Computer Security, Wroclaw, Poland, September 7–11, Part I, pp. 273–291. Springer, Berlin). Such HAE enables verifiable delegation computations over growing outsourced encrypted data in an efficient way.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages