Relevant bibliographies by topics / Secure search

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Secure search'

Author: Grafiati

Published: 3 June 2025

Last updated: 13 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Secure search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Secure search"

Raykova, Mariana, Ang Cui, Binh Vo, et al. "Usable, Secure, Private Search." IEEE Security & Privacy 10, no. 5 (2012): 53–60. http://dx.doi.org/10.1109/msp.2011.155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Gold, Steve. "In search of secure outsourcing." Computer Fraud & Security 2009, no. 2 (2009): 13–15. http://dx.doi.org/10.1016/s1361-3723(09)70021-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Varia, Mayank, Benjamin Price, Nicholas Hwang, et al. "Automated Assessment of Secure Search Systems." ACM SIGOPS Operating Systems Review 49, no. 1 (2015): 22–30. http://dx.doi.org/10.1145/2723872.2723877.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Romanova, Z. "Latin America in Search for Secure Economy." World Economy and International Relations, no. 11 (2003): 91–101. http://dx.doi.org/10.20542/0131-2227-2003-11-91-101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Lewis, Robert. "Bioenergetics In Search Of A Secure Self." Clinical Journal of the International Institute for Bioenergetic Analysis 17, no. 1 (2007): 135–64. http://dx.doi.org/10.30820/0743-4804-2007-17-135.

Full text

Abstract:

This paper, based on my personal experience and more recently available biographical and autobiographical sources, is an attempt to reevaluate classical (Lowenian) bioenergetic analysis from a perspective based on recent research from the attachment paradigm. Specifically, it explores the use of the body, its energy and sexuality as substitutes for a secure relationship with a caregiver.

APA, Harvard, Vancouver, ISO, and other styles

Ambika, M., Mangayarkarasi N., Raghuraman Gopalsamy, L. Sai Ramesh, and Kamalanathan Selvakumar. "Secure and Dynamic Multi-Keyword Ranked Search." International Journal of Operations Research and Information Systems 12, no. 3 (2021): 1–10. http://dx.doi.org/10.4018/ijoris.20210701.oa3.

Full text

Abstract:

Nowadays, information storing in third party storage is increased. Outsourcing the data to other storage device or servers which may questioned to the secure environment. However, sensitive data like medical information should need an privacy when it is stored in cloud storage. In this paper, a secure keyword search which provide the resultant data in a encrypted form where the end user can decrypt using the key given to them. It uses the Blowfish to encrypt the data and it also supports the data owner to delete or modify the content of their document. It also ensure accurate relevance score calculation between encrypted index and query vectors.

APA, Harvard, Vancouver, ISO, and other styles

Harane, Swati T. "SECURE SEARCH OVER ENCRYPTED DATA TECHNIQUES : SURVEY." International Journal of Advanced Research in Computer Science 8, no. 7 (2017): 575–77. http://dx.doi.org/10.26483/ijarcs.v8i7.4266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zhu, Yi, Xingming Sun, Zhihua Xia, and Naixue Xiong. "Secure Similarity Search over Encrypted Cloud Images." International Journal of Security and Its Applications 9, no. 8 (2015): 1–14. http://dx.doi.org/10.14257/ijsia.2015.9.8.01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

El Defrawy, Karim, and Sky Faber. "Blindfolded Data Search via Secure Pattern Matching." Computer 46, no. 12 (2013): 68–75. http://dx.doi.org/10.1109/mc.2013.73.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Li, Jin, Xiaofeng Chen, Fatos Xhafa, and Leonard Barolli. "Secure deduplication storage systems supporting keyword search." Journal of Computer and System Sciences 81, no. 8 (2015): 1532–41. http://dx.doi.org/10.1016/j.jcss.2014.12.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Secure search"

Katsilieris, Fotios. "Search and secure using mobile robots." Thesis, KTH, Reglerteknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105718.

Full text

Abstract:

This thesis project is about the search and secure problem for mobile robots. The search and secure problem refers to the problem where possible moving intruders have to be detected in a given area with obstacles that are represented as polygons. The solution to this problem is given by deploying robots in a proper way so that no intruder can remain undetected or sneak back to a secured area. An intruder is considered detected when he/she is in the field of view of the robots’ on-board cameras. As a first step, in the algorithm that solves the search and secure problem, the area is divided into triangles. The resulting triangles are then merged in order to form convex polygons. The next step is to abstract the actual regions into a topological graph where each polygon is represented by its centroid and the neighboring polygons are connected by edges. At this point, blocking robots are used to break the loops in the graph and prevent the intruders from escaping from the searchers. Then the number of the searchers is determined and their paths are created. Two solutions are proposed, one that requires more searchers but less time and one that requires the minimum number of searchers but more time. The last step is to create the trajectories that the robots have to follow. The functionality and the efficiency of the algorithm is verified through simulations and the results are visualized using Matlab and the AURES simulator and controller. The demonstration that was held at SAAB facilities in Linköping is also described.

APA, Harvard, Vancouver, ISO, and other styles

Wang, Boyang, and Boyang Wang. "Secure Geometric Search on Encrypted Spatial Data." Diss., The University of Arizona, 2017. http://hdl.handle.net/10150/625567.

Full text

Abstract:

Spatial data (e.g., points) have extensive applications in practice, such as spatial databases, Location-Based Services, spatial computing, social analyses, computational geometry, graph design, medical imaging, etc. Geometric queries, such as geometric range queries (i.e., finding points inside a geometric range) and nearest neighbor queries (i.e., finding the closest point to a given point), are fundamental primitives to analyze and retrieve information over spatial data. For example, a medical researcher can query a spatial dataset to collect information about patients in a certain geometric area to predict whether there will be a dangerous outbreak of a particular disease (e.g., Ebola or Zika). With the dramatic increase on the scale and size of data, many companies and organizations are outsourcing significant amounts of data, including significant amounts of spatial data, to public cloud data services in order to minimize data storage and query processing costs. For instance, major companies and organizations, such as Yelp, Foursquare and NASA, are using Amazon Web Services as their public cloud data services, which can save billions of dollars per year for those companies and organizations. However, due to the existence of attackers (e.g., a curious administrator or a hacker) on remote servers, users are worried about the leakage of their private data while storing and querying those data on public clouds. Searchable Encryption (SE) is an innovative technique to protect the data privacy of users on public clouds without losing search functionalities on the server side. Specifically, a user can encrypt its data with SE before outsourcing data to a public server, and this public server is able to search encrypted data without decryption. Many SE schemes have been proposed to support simple queries, such as keyword search. Unfortunately, how to efficiently and securely support geometric queries over encrypted spatial data remains open. In this dissertation, to protect the privacy of spatial data in public clouds while still maintaining search functions without decryption, we propose a set of new SE solutions to support geometric queries, including geometric range queries and nearest neighbor queries, over encrypted spatial data. The major contributions of this dissertation focus on two aspects. First, we enrich search functionalities by designing new solutions to carry out secure fundamental geometric search queries, which were not supported in previous works. Second, we minimize the performance gap between theory and practice by building novel schemes to perform geometric queries with highly efficient search time and updates over large-scale encrypted spatial data. Specifically, we first design a scheme supporting circular range queries (i.e., retrieving points inside a circle) over encrypted spatial data. Instead of directly evaluating compute-then-compare operations, which are inefficient over encrypted data, we use a set of concentric circles to represent a circular range query, and then verify whether a data point is on any of those concentric circles by securely evaluating inner products over encrypted data. Next, to enrich search functionalities, we propose a new scheme, which can support arbitrary geometric range queries, such as circles, triangles and polygons in general, over encrypted spatial data. By leveraging the properties of Bloom filters, we convert a geometric range search problem to a membership testing problem, which can be securely evaluated with inner products. Moving a step forward, we also build another new scheme, which not only supports arbitrary geometric range queries and sub-linear search time but also enables highly efficient updates. Finally, we address the problem of secure nearest neighbor search on encrypted large-scale datasets. Specifically, we modify the algorithm of nearest neighbor search in advanced tree structures (e.g., R-trees) by simplifying operations, where evaluating comparisons alone on encrypted data is sufficient to efficiently and correctly find nearest neighbors over datasets with millions of tuples.

APA, Harvard, Vancouver, ISO, and other styles

Wang, Bing. "Search over Encrypted Data in Cloud Computing." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/71466.

Full text

Abstract:

Cloud computing which provides computation and storage resources in a pay-per-usage manner has emerged as the most popular computation model nowadays. Under the new paradigm, users are able to request computation resources dynamically in real-time to accommodate their workload requirements. The flexible resource allocation feature endows cloud computing services with the capability to offer affordable and efficient computation services. However, moving data and applications into the cloud exposes a privacy leakage risk of the user data. As the growing awareness of data privacy, more and more users begin to choose proactive protection for their data in the cloud through data encryption. One major problem of data encryption is that it hinders many necessary data utilization functions since most of the functions cannot be directly applied to the encrypted data. The problem could potentially jeopardize the popularity of the cloud computing, therefore, achieving efficient data utilization over encrypted data while preserving user data privacy is an important research problem in cloud computing. The focus of this dissertation is to design secure and efficient schemes to address essential data utilization functions over encrypted data in cloud computing. To this end, we studied three problems in this research area. The first problem that is studied in this dissertation is fuzzy multi-keyword search over encrypted data. As fuzzy search is one of the most useful and essential data utilization functions in our daily life, we propose a novel design that incorporates Bloom filter and Locality-Sensitive Hashing to fulfill the security and function requirements of the problem. Secondly, we propose a secure index which is based on the most popular index structure, i.e., the inverted index. Our innovative design provides privacy protection over the secure index, the user query as well as the search pattern and the search result. Also, users can verify the correctness of the search results to ensure the proper computation is performed by the cloud. Finally, we focus ourselves on the privacy-sensitive data application in cloud computing, i.e., genetic testings over DNA sequences. To provide secure and efficient genetic testings in the cloud, we utilize Predicate Encryption and design a bilinear pairing based secure sequence matching scheme to achieve strong privacy guarantee while fulfilling the functionality requirement efficiently. In all of the three research thrusts, we present thorough theoretical security analysis and extensive simulation studies to evaluate the performance of the proposed schemes. The results demonstrate that the proposed schemes can effectively and efficiently address the challenging problems in practice. Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

Cao, Ning. "Secure and Reliable Data Outsourcing in Cloud Computing." Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-dissertations/333.

Full text

Abstract:

"The many advantages of cloud computing are increasingly attracting individuals and organizations to outsource their data from local to remote cloud servers. In addition to cloud infrastructure and platform providers, such as Amazon, Google, and Microsoft, more and more cloud application providers are emerging which are dedicated to offering more accessible and user friendly data storage services to cloud customers. It is a clear trend that cloud data outsourcing is becoming a pervasive service. Along with the widespread enthusiasm on cloud computing, however, concerns on data security with cloud data storage are arising in terms of reliability and privacy which raise as the primary obstacles to the adoption of the cloud. To address these challenging issues, this dissertation explores the problem of secure and reliable data outsourcing in cloud computing. We focus on deploying the most fundamental data services, e.g., data management and data utilization, while considering reliability and privacy assurance. The first part of this dissertation discusses secure and reliable cloud data management to guarantee the data correctness and availability, given the difficulty that data are no longer locally possessed by data owners. We design a secure cloud storage service which addresses the reliability issue with near-optimal overall performance. By allowing a third party to perform the public integrity verification, data owners are significantly released from the onerous work of periodically checking data integrity. To completely free the data owner from the burden of being online after data outsourcing, we propose an exact repair solution so that no metadata needs to be generated on the fly for the repaired data. The second part presents our privacy-preserving data utilization solutions supporting two categories of semantics - keyword search and graph query. For protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional data utilization based on plaintext keyword search. We define and solve the challenging problem of privacy-preserving multi- keyword ranked search over encrypted data in cloud computing. We establish a set of strict privacy requirements for such a secure cloud data utilization system to become a reality. We first propose a basic idea for keyword search based on secure inner product computation, and then give two improved schemes to achieve various stringent privacy requirements in two different threat models. We also investigate some further enhancements of our ranked search mechanism, including supporting more search semantics, i.e., TF Ã— IDF, and dynamic data operations. As a general data structure to describe the relation between entities, the graph has been increasingly used to model complicated structures and schemaless data, such as the personal social network, the relational database, XML documents and chemical compounds. In the case that these data contains sensitive information and need to be encrypted before outsourcing to the cloud, it is a very challenging task to effectively utilize such graph-structured data after encryption. We define and solve the problem of privacy-preserving query over encrypted graph-structured data in cloud computing. By utilizing the principle of filtering-and-verification, we pre-build a feature-based index to provide feature-related information about each encrypted data graph, and then choose the efficient inner product as the pruning tool to carry out the filtering procedure."

APA, Harvard, Vancouver, ISO, and other styles

Woodworth, Jason W. "Secure Semantic Search over Encrypted Big Data in the Cloud." Thesis, University of Louisiana at Lafayette, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10286646.

Full text

Abstract:

Cloud storage is a widely used service for both a personal and enterprise demands. However, despite its advantages, many potential users with sensitive data refrain from fully using the service due to valid concerns about data privacy. An established solution to this problem is to perform encryption on the client?s end. This approach, however, restricts data processing capabilities (e.g. searching over the data). In particular, searching semantically with real-time response is of interest to users with big data. To address this, this thesis introduces an architecture for semantically searching encrypted data using cloud services. It presents a method that accomplishes this by extracting and encrypting key phrases from uploaded documents and comparing them to queries that have been expanded with semantic information and then encrypted. It presents an additional method that builds o? of this and uses topic-based clustering to prune the amount of searched data and improve performance times for big-data-scale. Results of experiments carried out on real datasets with fully implemented prototypes show that results are accurate and searching is e?cient.

APA, Harvard, Vancouver, ISO, and other styles

Kulseng, Lars Skaar. "Lightweight mutual authentication, owner transfer, and secure search protocols for RFID systems." [Ames, Iowa : Iowa State University], 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Sun, Wenhai. "Towards Secure Outsourced Data Services in the Public Cloud." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/84396.

Full text

Abstract:

Past few years have witnessed a dramatic shift for IT infrastructures from a self-sustained model to a centralized and multi-tenant elastic computing paradigm -- Cloud Computing, which significantly reshapes the landscape of existing data utilization services. In truth, public cloud service providers (CSPs), e.g. Google, Amazon, offer us unprecedented benefits, such as ubiquitous and flexible access, considerable capital expenditure savings and on-demand resource allocation. Cloud has become the virtual ``brain" as well to support and propel many important applications and system designs, for example, artificial intelligence, Internet of Things, and so forth; on the flip side, security and privacy are among the primary concerns with the adoption of cloud-based data services in that the user loses control of her/his outsourced data. Encrypting the sensitive user information certainly ensures the confidentiality. However, encryption places an extra layer of ambiguity and its direct use may be at odds with the practical requirements and defeat the purpose of cloud computing technology. We believe that security in nature should not be in contravention of the cloud outsourcing model. Rather, it is expected to complement the current achievements to further fuel the wide adoption of the public cloud service. This, in turn, requires us not to decouple them from the very beginning of the system design. Drawing the successes and failures from both academia and industry, we attempt to answer the challenges of realizing efficient and useful secure data services in the public cloud. In particular, we pay attention to security and privacy in two essential functions of the cloud ``brain", i.e. data storage and processing. Our first work centers on the secure chunk-based deduplication of encrypted data for cloud backup and achieves the performance comparable to the plaintext cloud storage deduplication while effectively mitigating the information leakage from the low-entropy chunks. On the other hand, we comprehensively study the promising yet challenging issue of search over encrypted data in the cloud environment, which allows a user to delegate her/his search task to a CSP server that hosts a collection of encrypted files while still guaranteeing some measure of query privacy. In order to accomplish this grand vision, we explore both software-based secure computation research that often relies on cryptography and concentrates on algorithmic design and theoretical proof, and trusted execution solutions that depend on hardware-based isolation and trusted computing. Hopefully, through the lens of our efforts, insights could be furnished into future research in the related areas. Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

Towell, Alexander R. "Encrypted Search| Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents." Thesis, Southern Illinois University at Edwardsville, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1601582.

Full text

Abstract:

Encrypted Search is a way for a client to store searchable documents on untrusted systems such that the untrusted system can obliviously search the documents on the client's behalf, i.e., the untrusted system does not know what the client is searching for nor what the documents contain. Several new secure index types (which enable Encrypted Search functionality) are designed and implemented, and then compared against each other and against the more typical Bloom filter-based secure index. We compare them with respect to several performance measures: time complexity, space complexity, and retrieval accuracy with respect to two rank-ordered search heuristics, MinDist* and BM25. In order to support these search heuristics, the secure indexes must store frequency and proximity information. We investigate the risk this poses to confidentiality and explore ways to mitigate said risk. Finally, we analyze the effect the false positive rate and secure index poisoning techniques have on both confidentiality and performance. Separately, we also simulate an adversary who has access to a history of hidden (encrypted) queries and design techniques that demonstrably mitigate the risk posed by this adversary, e.g., query obfuscation, without adversely effecting retrieval accuracy.

APA, Harvard, Vancouver, ISO, and other styles

Dahl, Linnéa, and Hanna Sandström. "In Search for Secure Families : A study of what qualifies as a suitable family for vulnerable children at a child protection organization in South Africa." Thesis, Hälsohögskolan, Högskolan i Jönköping, HHJ, Avd. för beteendevetenskap och socialt arbete, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-40856.

Full text

Abstract:

Problem. Approximately 400 000 children are in the year 2018 living in foster care in South Africa. Many of these children have wounds from neglect and abuse from their original family. Even though foster care is intended to be a safe haven many of the children instead end up drifting from one foster home to another, waiting to be placed in a permanent family. Because of the deficiencies in foster care it is of importance to investigate the social workers’ views of a suitable family, since we believe this will affect the assessment, which in the end will affect the child. This thesis explores what conceptions social workers at a child protection organization in South Africa have of a suitable family for vulnerable children. Method. We interviewed seven social workers at mentioned organization, working with formal foster care and reunification with parents or relatives. We use theme analysis to process our findings which we thereafter analyze using Maslow’s hierarchy of needs. Result. Our findings reveal that the emotional needs of the child are considered most important by the social workers, followed by the physiological needs. Criminal behavior and poor values and morals are thought to make a family unsuitable. Conclusion. We found that there are some differences in the social workers’ conception of a suitable family for vulnerable children, although they all underlined the same factors as most important. They also state that these children are thought to have the same needs as any other child; it all comes down to what they consider is the best interest of the child. Regardless which values the individual social worker has, what they look for in every family is that the child will feel safe and loved. Problem. Cirka 400 000 barn lever i fostervård i Sydafrika år 2018. Många av dessa barn är påverkade av den försummelse och våld deras familj har utsatt dem för. Även att syftet med fostervård är att det ska vara en fristad är det många av barnen som flyttar från familj till familj och hela tiden väntar på att komma till en permanent familj. På grund av bristerna i fostervården är det viktigt att undersöka socialarbetarnas syn på en passande familj, eftersom vi anser att detta kommer påverka utredningen, vilket i slutändan kommer påverka barnet. Den här uppsatsen utforskar vad socialarbetare på en barnskyddsorganisation i Sydafrika uppfattar som en passande familj för utsatta barn. Metod: Vi intervjuade sju socialarbetare på nämnd organisation, som arbetar med formell fostervård och återförenande med föräldrar eller släktingar. Vi använder tematisk analys för att bearbeta vårt undersökningsresultat vilket vi sedan analyserar med Maslows behovstrappa. Resultat. Våra undersökningsresultat visar att socialarbetarna anser att de emotionella behoven hos barnet är de viktigaste, vilka sedan följs av de fysiologiska behoven. Kriminellt beteende och olämpliga värderingar och moral tros utgöra en opassande familj. Slutsats. Resultatet visar att det är vissa skillnader i socialarbetarnas uppfattning av en passande familj för utsatta barn, samtidigt som de alla betonar samma faktorer som mest viktiga. De menar också att dessa barn anses ha samma behov som vilket annat barn som helst; allt handlar om vad de anser är det bästa för barnet. Oavsett vilka värderingar den individuella socialarbetaren har, vad de letar efter i varje familj är att barnet ska kunna känna sig säkert och älskat.

APA, Harvard, Vancouver, ISO, and other styles

Priddis, DeAnne. "The search for work-life balance at SECURA." Menomonie, WI : University of Wisconsin--Stout, 2006. http://www.uwstout.edu/lib/thesis/2006/2006priddisd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Secure search"

Davis-Secord, Sarah. Migration in the Medieval Mediterranean. Amsterdam University Press, 2021. http://dx.doi.org/10.5117/9781641892667.

Full text

Abstract:

Migration in the Medieval Mediterranean argues that the cross-Mediterranean movement of peoples was a central aspect of the medieval world. Medieval people migrated in search of safety after regime change, secure life amongst coreligionists, and prosperous careers. This kind of travel between Muslim and Christian regions demonstrates the mutual influences, interconnections, and communications linking them, surpassing the differences between the two civilizations.

APA, Harvard, Vancouver, ISO, and other styles

Akulov, Nikolay. TESTING OF SEDIMENTARY DEPOSITS AT DIAMOND SEARCHING WORKS. AUS PUBLISHERS, 2022. http://dx.doi.org/10.26526/monography_62021f624d9c18.71126120.

Full text

Abstract:

The book contains materials on the search for modern and buried alluvial and primary deposits of diamonds. Much attention is paid to prospecting testing of potentially diamondiferous deposits and provides information on all types of diamondiferous rocks currently known. It is addressed primarily to young geologists who have embarked on a search for diamond deposits. It will find the answer to many questions by many geologists, prospectors and prospectors, leading the search for gold and diamonds. While this information product, for the most part, is in the public domain, it also may contain copyrighted materials as noted in the text. Permission to reproduce copyrighted items must be secured from the copyright owner.

APA, Harvard, Vancouver, ISO, and other styles

Stockwell, John. In search of enimies [sic]: A CIA story. Replica Books, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

C, Green Laura, and Roberts Marc J, eds. In search of safety: Chemicals and cancer risk. Harvard University Press, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

1943-, Boyer Robert, ed. The search for labour market flexibility: The European economies in transition. Clarendon Press, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Holmes, Jeremy. The Search for the Secure Base. Routledge, 2014. http://dx.doi.org/10.4324/9781315783260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Search for the Secure Base: Attachment Theory and Psychotherapy. Routledge, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Holmes, Jeremy. Search for the Secure Base: Attachment Theory and Psychotherapy. Taylor & Francis Group, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Holmes, Jeremy. Search for the Secure Base: Attachment Theory and Psychotherapy. Taylor & Francis Group, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

The search for the secure base: Attachment theory and psychotherapy. Brunner-Routledge, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Secure search"

Zhang, Yuan, Chunxiang Xu, and Xuemin Sherman Shen. "Secure Keyword Search." In Data Security in Cloud Storage. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-4374-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Hazay, Carmit, and Yehuda Lindell. "Search Problems." In Efficient Secure Two-Party Protocols. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14303-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Ohtake, Go, Reihaneh Safavi-Naini, and Liang Feng Zhang. "Outsourcing of Verifiable Attribute-Based Keyword Search." In Secure IT Systems. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70290-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Park, Hyun-A., Jin Wook Byun, and Dong Hoon Lee. "Secure Index Search for Groups." In Trust, Privacy, and Security in Digital Business. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537878_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Sun, Wenhai, Wenjing Lou, Y. Thomas Hou, and Hui Li. "Privacy-Preserving Keyword Search Over Encrypted Data in Cloud Computing." In Secure Cloud Computing. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9278-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Li, You, Kaiyu Hou, Yunqi He, Yan Chen, and Hai Zhou. "Property Guided Secure Configuration Space Search." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-75764-8_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Kim, Jinhan, Michael G. Epitropakis, and Shin Yoo. "Learning Without Peeking: Secure Multi-party Computation Genetic Programming." In Search-Based Software Engineering. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99241-9_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zou, Yanzhen, Changsheng Liu, Yong Jin, and Bing Xie. "Assessing Software Quality through Web Comment Search and Analysis." In Safe and Secure Software Reuse. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38977-1_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Golle, Philippe, Jessica Staddon, and Brent Waters. "Secure Conjunctive Keyword Search over Encrypted Data." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24852-1_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Krell, Fernando, Gabriela Ciocarlie, Ashish Gehani, and Mariana Raykova. "Low-Leakage Secure Search for Boolean Expressions." In Topics in Cryptology – CT-RSA 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52153-4_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Secure search"

Singh, Akansha, Venkata Bhikshapathi Chenam, and Syed Taqi Ali. "Enhanced provably secure public key encryption with keyword search scheme for secure cloud-based keyword search." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10725485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Wang, Xuejian, and Baodong Qin. "Multi-keyword secure search of encrypted cloud data based on semantics." In 2024 6th International Conference on Natural Language Processing (ICNLP). IEEE, 2024. http://dx.doi.org/10.1109/icnlp60986.2024.10692872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zhong, Ziyang, Pan Chang, and Min Cai. "Achieving efficient and secure keyword attribute community search on cloud servers." In Fifth International Conference on Computer Communication and Network Security (CCNS 2024), edited by Zhiyong Xiong and Zhaolong Ning. SPIE, 2024. http://dx.doi.org/10.1117/12.3038169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Park, Hyun-A., Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, and Justin Zhan. "Secure Similarity Search." In 2007 IEEE International Conference on Granular Computing (GRC 2007). IEEE, 2007. http://dx.doi.org/10.1109/grc.2007.4403170.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Full text

APA, Harvard, Vancouver, ISO, and other styles

SILAGHI, MARIUS-CĂLIN, DJAMILA SAM-HAROUD, and BOI FALTINGS. "SECURE ASYNCHRONOUS SEARCH." In Proceedings of the 2nd Asia-Pacific Conference on IAT. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812811042_0054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Raykova, Mariana, Binh Vo, Steven M. Bellovin, and Tal Malkin. "Secure anonymous database search." In the 2009 ACM workshop. ACM Press, 2009. http://dx.doi.org/10.1145/1655008.1655025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Uchiyama, Tomoki, and Kana Shimizu. "Secure Full-Text Search Using Function Secret Sharing." In CCS '24: ACM SIGSAC Conference on Computer and Communications Security. ACM, 2023. http://dx.doi.org/10.1145/3689943.3695052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Hahn, Florian, Nicolas Loza, and Florian Kerschbaum. "Practical and Secure Substring Search." In SIGMOD/PODS '18: International Conference on Management of Data. ACM, 2018. http://dx.doi.org/10.1145/3183713.3183754.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Bailey, Peter, David Hawking, and Brett Matson. "Secure search in enterprise webs." In the 15th ACM international conference. ACM Press, 2006. http://dx.doi.org/10.1145/1183614.1183686.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Secure search"

Aldrich, Susan. Oracle Secure Enterprise Search V. 10.1.8 Evaluation. Patricia Seybold Group, 2006. http://dx.doi.org/10.1571/pr12-21-06cc.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Nance, Brad. Using Splunk® Enterprise Search Commands for Advanced Analysis of Ivanti Connect Secure© Logs. Office of Scientific and Technical Information (OSTI), 2022. http://dx.doi.org/10.2172/1872843.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Harbitz, Mia Elisabeth, and María del Carmen Tamargo. The Significance of Legal Identity in Situations of Poverty and Social Exclusion: The Link between Gender, Ethnicity, and Legal Identity. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0009023.

Full text

Abstract:

Failure to register births and lack of legal identity are considered to have a direct effect on possibilities and opportunities for full participation in social, political, and economic life. In order to understand the characteristics, numbers, and location of the economically, culturally, and socially vulnerable groups that are excluded from access to legal identity, studies were carried out in Bolivia, Ecuador, and Guatemala. The study does not claim to be exhaustive; rather it is meant to be a constructive contribution to the search for practical solutions that will help countries achieve universal, reliable, integrated, and secure legal identity for all of their citizens.

APA, Harvard, Vancouver, ISO, and other styles

Langlais, Pierre-Carl. Bibliometrics. Comité pour la science ouverte, 2023. https://doi.org/10.52949/73.

Full text

Abstract:

Bibliometrics is deeply transformed by open science. The unprecedented availability of bibliographic metadata, full text search and additional use metrics creates new opportunities for quantitative studies of scientific corpus. It also challenges the historical focus of bibliometrics on citation data from a few selected journals. New approaches aim to expand its scope to different uses and different publics, especially in regard to the social impact of research. As a field, bibliometrics has been strongly influenced by the first commercial infrastructure for academic publications. In the 1960s, the Science Citation Index laid the fundamental basis of a structured research program on bibliometrics, with a primary focus on citation data and citation network from esteemed English-speaking journals in STM. This selective approach made it possible to run one of the first search engines with the limited computing technologies of the 1960s and has proven to be a direct inspiration for the search algorithm of Google (the “pagerank”). Yet, it also introduces several performative biases, as journals excluded from index on various grounds (non-English language, non-STM research) also become in turn less visible. As bibliometric indicators have been increasingly used in research evaluation and management, it ultimately penalized a large range of scholarly output and harmed the diversity of scientific activities. The development of the web had an immediate impact on bibliometrics. While hyperlinks are analogous to citation data, their use is not limited to scientific publications and can be applied to any publications. Alternative labels like webometrics, infometrics or cybermetrics have attempted to redefine and expand bibliometric analysis to a larger variety of documents and digital objects. The open science movements had originally a mixed relationship to bibliometrics. Publications in open access were initially supposed to have a citation advantage due to increased visibility and bibliometric indicators have been commonly used as arguments in favor of a transition to open science. Yet, bibliometric indexes (like the impact factor of the h-index) have also contributed to secure the position of major commercial publishers and possibly delay the transition to open science. Alternative approaches of bibliometrics (the altmetrics) have aimed to reframe bibliometric indicators to better integrate the values and objectives of open science, by taking into account non-academic uses through log analysis or social data metrics. By the end 2020s, the field of bibliometrics itself underwent an open science revolution. With the opening of scientific data and metadata, commercial vendors like the Web of science are displaced by public and community-led initiatives like the Initiative for Open Citations or Wikidata. Major actors in bibliometrics have started to rethink their methods, their research identity and their relationship with the leading commercial database, and adopting the broader label of Quantitative Science Studies.

APA, Harvard, Vancouver, ISO, and other styles

Slattery, Kevin T. Unsettled Aspects of the Digital Thread in Additive Manufacturing. SAE International, 2021. http://dx.doi.org/10.4271/epr2021026.

Full text

Abstract:

In the past years, additive manufacturing (AM), also known as “3D printing,” has transitioned from rapid prototyping to making parts with potentially long service lives. Now AM provides the ability to have an almost fully digital chain from part design through manufacture and service. Web searches will reveal many statements that AM can help an organization in its pursuit of a “digital thread.” Equally, it is often stated that a digital thread may bring great benefits in improving designs, processes, materials, operations, and the ability to predict failure in a way that maximizes safety and minimizes cost and downtime. Now that the capability is emerging, a whole series of new questions begin to surface as well: •• What data should be stored, how will it be stored, and how much space will it require? •• What is the cost-to-benefit ratio of having a digital thread? •• Who owns the data and who can access and analyze it? •• How long will the data be stored and who will store it? •• How will the data remain readable and usable over the lifetime of a product? •• How much manipulation of disparate data is necessary for analysis without losing information? •• How will the data be secured, and its provenance validated? •• How does an enterprise accomplish configuration management of, and linkages between, data that may be distributed across multiple organizations? •• How do we determine what is “authoritative” in such an environment? These, along with many other questions, mark the combination of AM with a digital thread as an unsettled issue. As the seventh title in a series of SAE EDGE™ Research Reports on AM, this report discusses what the interplay between AM and a digital thread in the mobility industry would look like. This outlook includes the potential benefits and costs, the hurdles that need to be overcome for the combination to be useful, and how an organization can answer these questions to scope and benefit from the combination. This report, like the others in the series, is directed at a product team that is implementing AM. Unlike most of the other reports, putting the infrastructure in place, addressing the issues, and taking full advantage of the benefits will often fall outside of the purview of the product team and at the higher organizational, customer, and industry levels.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!