In a hierarchical system, a set of users with ranked rights are organized in a tree-architecture, and the user with higher grade can search and access data of users with lower grade in its branch. Nowadays hierarchica...
详细信息
ISBN:
(纸本)9781509018949
In a hierarchical system, a set of users with ranked rights are organized in a tree-architecture, and the user with higher grade can search and access data of users with lower grade in its branch. Nowadays hierarchical systems are constructed by utilizing the cloud to improve their performance due to the cloud server's powerful computation and storage capabilities. However, the untrusted cloud server may give rise to the risk of private information exposure. To enable ranked and controllable data search in cloud without revealing users' privacy in a hierarchical system is a challenging open problem. In this paper, we formally define the hierarchical searchable encryption, where the user in the hierarchical system can search the data of its descendants. A basic hierarchical ID-based searchable encryption (HIBSE) scheme with constant size ciphertext and probe (i.e. trapdoor) is proposed, which satisfies IND-sID-CKA security. An extended secure channel free HIBSE scheme is also given, where the user can search the data of all his descendants at one time, and it achieves IND-sID-OKGA. The performance evaluation demonstrates that the extended scheme greatly reduces the computation cost when the user searches the data of all his descendants in the branch. Therefore, the extended scheme is efficient and practical in various applications.
The cover image, by Wei Wang et al., is based on the Article Surface shapes and surrounding environment analysis of single- and double-stranded DNAbinding proteins in protein-DNA interface, DOI: .
The cover image, by Wei Wang et al., is based on the Article Surface shapes and surrounding environment analysis of single- and double-stranded DNAbinding proteins in protein-DNA interface, DOI: .
computerscience offers a large set of tools for prototyping, writing, running, testing, validating, sharing and reproducing results, however computational science lags behind. In the best case, authors may provide th...
详细信息
A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mits...
A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni
Monitoring data in coal mine is essentially data stream, and missing coal mine monitoring data is caused by harsh coal mine environment, therefore coal mine safety evaluation can be seen as incomplete labeled data str...
详细信息
The AAAI-14 Workshop program was held Sunday and Monday, July 27-28, 2014, at the Québec City Convention Centre in Québec, Canada. The AAAI-14 workshop program included 15 workshops covering a wide range of ...
详细信息
We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are kno...
We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks and generalise Spearman's ρ to extreme ranks. Our main contribution is the derivation of a non-parametric estimator for rank aggregation based on multivariate extensions of Spearman's ρ, which measures correlation between a set of ranked lists. Multivariate Spearman's ρ is defined using copulas, and we show that the geometric mean of normalised ranks maximises multivariate correlation. Motivated by this, we propose a weighted geometric mean approach for learning to rank which has a closed form least squares solution. When only the best (top-k) or worst (bottom-k) elements of a ranked list are known, we impute the missing ranks by the average value, allowing us to apply Spearman's ρ. We discuss an optimistic and pessimistic imputation of missing values, which respectively maximise and minimise correlation, and show its effect on aggregating university rankings. Finally, we demonstrate good performance on the rank aggregation benchmarks MQ2007 and MQ2008.
暂无评论