Relevant bibliographies by topics / Memory security

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Memory security'

Author: Grafiati
Published: 7 July 2024
Last updated: 22 June 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 'Memory security.'

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 "Memory security"

1

Apryshchenko, V. Yu. "Memory as Security." New Past, no. 3 (2016): 86–108. http://dx.doi.org/10.18522/2500-3224-2016-3-86-108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sha, Mo, Yifan Cai, Sheng Wang, Linh Thi Xuan Phan, Feifei Li, and Kian-Lee Tan. "Object-oriented Unified Encrypted Memory Management for Heterogeneous Memory Architectures." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–29. http://dx.doi.org/10.1145/3654958.

Full text
Abstract:
In contemporary database applications, the demand for memory resources is intensively high. To enhance adaptability to varying resource needs and improve cost efficiency, the integration of diverse storage technologies within heterogeneous memory architectures emerges as a promising solution. Despite the potential advantages, there exists a significant gap in research related to the security of data within these complex systems. This paper endeavors to fill this void by exploring the intricacies and challenges of ensuring data security in object-oriented heterogeneous memory systems. We introduce the concept of Unified Encrypted Memory (UEM) management, a novel approach that provides unified object references essential for data management platforms, while simultaneously concealing the complexities of physical scheduling from developers. At the heart of UEM lies the seamless and efficient integration of data encryption techniques, which are designed to ensure data integrity and guarantee the freshness of data upon access. Our research meticulously examines the security deficiencies present in existing heterogeneous memory system designs. By advancing centralized security enforcement strategies, we aim to achieve efficient object-centric data protection. Through extensive evaluations conducted across a variety of memory configurations and tasks, our findings highlight the effectiveness of UEM. The security features of UEM introduce low and acceptable overheads, and UEM outperforms conventional security measures in terms of speed and space efficiency.
APA, Harvard, Vancouver, ISO, and other styles
3

Lescisin, Michael, and Qusay H. Mahmoud. "Evaluation of Dynamic Analysis Tools for Software Security." International Journal of Systems and Software Security and Protection 9, no. 3 (2018): 34–59. http://dx.doi.org/10.4018/ijsssp.2018070102.

Full text
Abstract:
This article discusses the development of secure software by means of dynamic analysis tools. A secure software-based system should have security checks and balances integrated throughout its entire development lifecycle, including its deployment phase. Therefore, this article covers both using software security tools for testing code in development as well as monitoring code in deployment to ensure that it is operating securely. The security issues discussed in this article will be split into two categories – memory safety issues and input validation issues. Memory safety issues concern problems of unauthorized memory access such as buffer overflows, stack overflows, use-after-free, double-free, memory leaks, etc. Although not strictly a memory safety issue, concurrency issues, such as data races, will be considered as memory safety issues in this article. Input validation issues concern problems where untrusted input is directly passed to handlers which are designed to handle both data and commands. Examples of this include path traversal, SQL injection, command injection, JavaScript/HTML injection, etc. As a result of this significant difference between these two types of security vulnerabilities, two sets of tools are evaluated with one set focusing on memory safety issues and the other on input validation issues. This article explores the benefits and limitations of current software dynamic analysis tools by evaluating them against both the authors test cases as well as the OWASP Benchmark for Security Automation and proposes solutions for implementing secure software applications.
APA, Harvard, Vancouver, ISO, and other styles
4

Yuliana, Mike, Nuril Hidayah, and Amang Sudarsono. "Implementation of Web-Based File Sharing Security System." MOTIVECTION : Journal of Mechanical, Electrical and Industrial Engineering 6, no. 1 (2024): 41–52. http://dx.doi.org/10.46574/motivection.v6i1.314.

Full text
Abstract:
File-sharing activities become a bridge for communication in the form of data between one party and another party. File sharing allows users to share data with other users, by uploading data to the server computer and other users can download data from the server computer. A document security system is indispensable to keep document data safe until its destination. File Web Sharing will transmit data with cryptographic methodologies. The algorithm used is Advanced Encryption Standard (AES), Data Encryption Standard (DES), and Blowfish. This study aims to compare the performance of AES, DES, and Blowfish algorithms when implemented to secure file sharing. Performance research results show that the DES algorithm is on average 8.35% faster than AES and the Blowfish algorithm is 7.11% faster than AES. Memory usage capacity testing shows that the AES algorithm requires 4.82% greater memory capacity than Blowfish, and the DES requires 2.41% greater memory capacity than the Blowfish algorithm. Kegiatan file sharing menjadi jembatan komunikasi data antara satu pihak dengan pihak lainnya. File sharing memberikan pengguna kemampuan untuk berbagi data dengan pengguna lain, dengan cara mengunggah data ke komputer server dan pengguna lain dapat mengunduh data dari komputer server. Sistem keamanan terhadap dokumen sangat diperlukan untuk menjaga data dokumen tetap aman sampai tujuannya. Web File Sharing akan mengirimkan data dengan metodologi kriptografi. Algoritma yang digunakan adalah Advanced Encryption Standard (AES), Data Encryption Standard (DES), dan Blowfish. Penelitian ini bertujuan untuk membandingkan kinerja algoritma AES, DES dan Blowfish saat diimplementasikan untuk mengamankan file sharing. Hasil pengujian kinerja menunjukkan bahwa algoritma DES rata-rata 8,35% lebih cepat dibandingkan AES sedangkan Blowfish 7,11% lebih cepat dibandingkan AES. Berdasarkan pengujian kapasitas penggunaan memori terlihat bahwa AES membutuhkan kapasitas memori 4,82% lebih besar dibandingkan Blowfish dan DES membutuhkan kapasitas memori 2,41% lebih besar dari Blowfish.
APA, Harvard, Vancouver, ISO, and other styles
5

Younan, Yves, Wouter Joosen, Frank Piessens, and Hans Van den Eynden. "Improving Memory Management Security for C and C++." International Journal of Secure Software Engineering 1, no. 2 (2010): 57–82. http://dx.doi.org/10.4018/jsse.2010040104.

Full text
Abstract:
Memory managers are an important part of modern language and are used to dynamically allocate memory. Many managers exist; however, two major types can be identified: manual memory allocators and garbage collectors. In the case of manual memory allocators, the programmer must manually release memory back to the system when it is no longer needed. Problems can occur when a programmer forgets to release it, releases it twice or uses freed memory. These problems are solved in garbage collectors. However, both manual memory allocators and garbage collectors store management information. This paper describes several vulnerabilities for C and C++ and how these could be remedied by modifying the management information of a representative manual memory allocator and garbage collector. Additionally, the authors present an approach that, when applied to memory managers, will protect against these attack vectors.
APA, Harvard, Vancouver, ISO, and other styles
6

Crenne, Jérémie, Romain Vaslin, Guy Gogniat, Jean-Philippe Diguet, Russell Tessier, and Deepak Unnikrishnan. "Configurable memory security in embedded systems." ACM Transactions on Embedded Computing Systems 12, no. 3 (2013): 1–23. http://dx.doi.org/10.1145/2442116.2442121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gustafsson, Karl, and Maria Mälksoo. "Memory-Political Deterrence: Shielding Collective Memory and Ontological Security through Dissuasion." International Studies Quarterly 68, no. 1 (2024): 1–12. https://doi.org/10.1093/isq/sqae006.

Full text
Abstract:
Traditionally used within the context of hard military power in interstate relations, the concept of deterrence has been progressively extended to non-state actors and new issue areas. While scholarship on the social aspects of deterrence has expanded our understanding of this core international security practice, the focus of existing research has largely remained on physical security. This article argues that there is a phenomenon in international politics that can be called memory-political deterrence. Memory-political deterrence refers to the ways in which states seek to dissuade other political actors from taking actions that threaten the collective memory narratives that underpin the ontological security of the deterring actor. Memory-political deterrence works, for example, through political rhetoric, declarations, diplomatic insults, commemorative practices, and punitive memory laws. We illustrate the article’s arguments through empirical examples from Russia’s and China’s recent memory-political deterrence efforts toward Ukraine and Japan, respectively. In doing so, we elucidate the ways in which memory politics is intertwined with geopolitics, underpinning wider world-ordering aspirations.
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Jinjae, Derry Pratama, Minjae Kim, Howon Kim, and Donghyun Kwon. "CoMeT: Configurable Tagged Memory Extension." Sensors 21, no. 22 (2021): 7771. http://dx.doi.org/10.3390/s21227771.

Full text
Abstract:
Commodity processor architectures are releasing various instruction set extensions to support security solutions for the efficient mitigation of memory vulnerabilities. Among them, tagged memory extension (TME), such as ARM MTE and SPARC ADI, can prevent unauthorized memory access by utilizing tagged memory. However, our analysis found that TME has performance and security issues in practical use. To alleviate these, in this paper, we propose CoMeT, a new instruction set extension for tagged memory. The key idea behind CoMeT is not only to check whether the tag values in the address tag and memory tag are matched, but also to check the access permissions for each tag value. We implemented the prototype of CoMeT on the RISC-V platform. Our evaluation results confirm that CoMeT can be utilized to efficiently implement well-known security solutions, i.e., shadow stack and in-process isolation, without compromising security.
APA, Harvard, Vancouver, ISO, and other styles
9

Toymentsev, Sergey. "Russia's Historical Memory: Strict-Security or Hybrid?" Ab Imperio 2013, no. 2 (2013): 336–45. http://dx.doi.org/10.1353/imp.2013.0042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

English, Erin. "New PCMCIA card offers security and memory." Computer Fraud & Security Bulletin 1995, no. 3 (1995): 5–6. http://dx.doi.org/10.1016/0142-0496(95)80128-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Memory security"

1

Talhi, Chamseddine. "Memory-Constrained Security Enforcement." Doctoral thesis, Québec : Université Laval, 2007. http://www.theses.ulaval.ca/2007/24434/24434.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cadar, Cristian. "Enhancing availability and security through boundless memory blocks." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/33123.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (leaves 49-52).<br>We present a new technique, boundless memory blocks, that automatically eliminates buffer overflow errors, enabling programs to continue to execute through memory errors without memory corruption. Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt other data structures. The standard way to exploit a buffer overflow vulnerability involves a request that is too large for the buffer intended to hold it. The buffer overflow error causes the program to write part of the request beyond the bounds of the buffer, corrupting the address space of the program and causing the program to execute injected code contained in the request. Our boundless memory blocks compiler inserts checks that dynamically detect all out of bounds accesses. When it detects an out of bounds write, it stores the value away in a hash. Our compiler can then return the stored value as the result of an out of bounds read to that address. In the case of uninitialized addresses, our compiler simply returns a predefined value. We have acquired several widely used open source applications (Apache, Sendmail, Pine, Mutt, and Midnight Commander). With standard compilers, all of these applications are vulnerable to buffer overflow attacks as documented at security tracking web sites. Instead, our compiler enables the applications to execute successfully through buffer overflow attacks to continue to correctly service user requests without security vulnerabilities. We have also found that only one application contains uninitialized reads, which means that in most cases, the net effect of our compiler is to (conceptually) give each allocated memory block unbounded size and to eliminate out of bounds accesses as a programming error.<br>by Cristian Cadar.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
3

Chuang, Weihaw. "Maintaining safe memory for security, debugging, and multi-threading." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2006. http://wwwlib.umi.com/cr/ucsd/fullcit?p3223012.

Full text
Abstract:
Thesis (Ph. D.)--University of California, San Diego, 2006.<br>Title from first page of PDF file (viewed September 21, 2006). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 164-172).
APA, Harvard, Vancouver, ISO, and other styles
4

Sylve, Joseph T. "Android Memory Capture and Applications for Security and Privacy." ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/1400.

Full text
Abstract:
The Android operating system is quickly becoming the most popular platform for mobiledevices. As Android’s use increases, so does the need for both forensic and privacy toolsdesigned for the platform. This thesis presents the first methodology and toolset for acquiringfull physical memory images from Android devices, a proposed methodology for forensicallysecuring both volatile and non-volatile storage, and details of a vulnerability discovered by theauthor that allows the bypass of the Android security model and enables applications to acquirearbitrary permissions.
APA, Harvard, Vancouver, ISO, and other styles
5

Marco, Gisbert Héctor. "Cyber-security protection techniques to mitigate memory errors exploitation." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/57806.

Full text
Abstract:
[EN] Practical experience in software engineering has demonstrated that the goal of building totally fault-free software systems, although desirable, is impossible to achieve. Therefore, it is necessary to incorporate mitigation techniques in the deployed software, in order to reduce the impact of latent faults. This thesis makes contributions to three memory corruption mitigation techniques: the stack smashing protector (SSP), address space layout randomisation (ASLR) and automatic software diversification. The SSP is a very effective protection technique used against stack buffer overflows, but it is prone to brute force attacks, particularly the dangerous byte-for-byte attack. A novel modification, named RenewSSP, has been proposed which eliminates brute force attacks, can be used in a completely transparent way with existing software and has negligible overheads. There are two different kinds of application for which RenewSSP is especially beneficial: networking servers (tested in Apache) and application launchers (tested on Android). ASLR is a generic concept with multiple designs and implementations. In this thesis, the two most relevant ASLR implementations of Linux have been analysed (Vanilla Linux and PaX patch), and several weaknesses have been found. Taking into account technological improvements in execution support (compilers and libraries), a new ASLR design has been proposed, named ASLR-NG, which maximises entropy, effectively addresses the fragmentation issue and removes a number of identified weaknesses. Furthermore, ASLR-NG is transparent to applications, in that it preserves binary code compatibility and does not add overheads. ASLR-NG has been implemented as a patch to the Linux kernel 4.1. Software diversification is a technique that covers a wide range of faults, including memory errors. The main problem is how to create variants, i.e. programs which have identical behaviours on normal inputs but where faults manifest differently. A novel form of automatic variant generation has been proposed, using multiple cross-compiler suites and processor emulators. One of the main goals of this thesis is to create applicable results. Therefore, I have placed particular emphasis on the development of real prototypes in parallel with the theoretical study. The results of this thesis are directly applicable to real systems; in fact, some of the results have already been included in real-world products.<br>[ES] La creación de software supone uno de los retos más complejos para el ser humano ya que requiere un alto grado de abstracción. Aunque se ha avanzado mucho en las metodologías para la prevención de los fallos software, es patente que el software resultante dista mucho de ser confiable, y debemos asumir que el software que se produce no está libre de fallos. Dada la imposibilidad de diseñar o implementar sistemas libres de fallos, es necesario incorporar técnicas de mitigación de errores para mejorar la seguridad. La presente tesis realiza aportaciones en tres de las principales técnicas de mitigación de errores de corrupción de memoria: Stack Smashing Protector (SSP), Address Space Layout Randomisation (ASLR) y Automatic Software Diversification. SSP es una técnica de protección muy efectiva contra ataques de desbordamiento de buffer en pila, pero es sensible a ataques de fuerza bruta, en particular al peligroso ataque denominado byte-for-byte. Se ha propuesto una novedosa modificación del SSP, llamada RenewSSP, la cual elimina los ataques de fuerza bruta. Puede ser usada de manera completamente transparente con los programas existentes sin introducir sobrecarga. El RenewSSP es especialmente beneficioso en dos áreas de aplicación: Servidores de red (probado en Apache) y lanzadores de aplicaciones eficientes (probado en Android). ASLR es un concepto genérico, del cual hay multitud de diseños e implementaciones. Se han analizado las dos implementaciones más relevantes de Linux (Vanilla Linux y PaX patch), encontrándose en ambas tanto debilidades como elementos mejorables. Teniendo en cuenta las mejoras tecnológicas en el soporte a la ejecución (compiladores y librerías), se ha propuesto un nuevo diseño del ASLR, llamado ASLR-NG, el cual: maximiza la entropía, soluciona el problema de la fragmentación y elimina las debilidades encontradas. Al igual que la solución propuesta para el SSP, la nueva propuesta de ASLR es transparente para las aplicaciones y compatible a nivel binario sin introducir sobrecarga. ASLR-NG ha sido implementado como un parche del núcleo de Linux para la versión 4.1. La diversificación software es una técnica que cubre una amplia gama de fallos, incluidos los errores de memoria. La principal dificultad para aplicar esta técnica radica en la generación de las "variantes", que son programas que tienen un comportamiento idéntico entre ellos ante entradas normales, pero tienen un comportamiento diferenciado en presencia de entradas anormales. Se ha propuesto una novedosa forma de generar variantes de forma automática a partir de un mismo código fuente, empleando la emulación de sistemas. Una de las máximas de esta investigación ha sido la aplicabilidad de los resultados, por lo que se ha hecho especial hincapié en el desarrollo de prototipos sobre sistemas reales a la par que se llevaba a cabo el estudio teórico. Como resultado, las propuestas de esta tesis son directamente aplicables a sistemas reales, algunas de ellas ya están siendo explotadas en la práctica.<br>[CAT] La creació de programari suposa un dels reptes més complexos per al ser humà ja que requerix un alt grau d'abstracció. Encara que s'ha avançat molt en les metodologies per a la prevenció de les fallades de programari, és palès que el programari resultant dista molt de ser confiable, i hem d'assumir que el programari que es produïx no està lliure de fallades. Donada la impossibilitat de dissenyar o implementar sistemes lliures de fallades, és necessari incorporar tècniques de mitigació d'errors per a millorar la seguretat. La present tesi realitza aportacions en tres de les principals tècniques de mitigació d'errors de corrupció de memòria: Stack Smashing Protector (SSP), Address Space Layout Randomisation (ASLR) i Automatic Software Diversification. SSP és una tècnica de protecció molt efectiva contra atacs de desbordament de buffer en pila, però és sensible a atacs de força bruta, en particular al perillós atac denominat byte-for-byte. S'ha proposat una nova modificació del SSP, RenewSSP, la qual elimina els atacs de força bruta. Pot ser usada de manera completament transparent amb els programes existents sense introduir sobrecàrrega. El RenewSSP és especialment beneficiós en dos àrees d'aplicació: servidors de xarxa (provat en Apache) i llançadors d'aplicacions eficients (provat en Android). ASLR és un concepte genèric, del qual hi ha multitud de dissenys i implementacions. S'han analitzat les dos implementacions més rellevants de Linux (Vanilla Linux i PaX patch), trobant-se en ambdues tant debilitats com elements millorables. Tenint en compte les millores tecnològiques en el suport a l'execució (compiladors i llibreries), s'ha proposat un nou disseny de l'ASLR: ASLR-NG, el qual, maximitza l'entropia, soluciona el problema de la fragmentació i elimina les debilitats trobades. Igual que la solució proposada per al SSP, la nova proposta d'ASLR és transparent per a les aplicacions i compatible a nivell binari sense introduir sobrecàrrega. ASLR-NG ha sigut implementat com un pedaç del nucli de Linux per a la versió 4.1. La diversificació de programari és una tècnica que cobrix una àmplia gamma de fa\-llades, inclosos els errors de memòria. La principal dificultat per a aplicar esta tècnica radica en la generació de les "variants", que són programes que tenen un comportament idèntic entre ells davant d'entrades normals, però tenen un comportament diferenciat en presència d'entrades anormals. S'ha proposat una nova forma de generar variants de forma automàtica a partir d'un mateix codi font, emprant l'emulació de sistemes. Una de les màximes d'esta investigació ha sigut l'aplicabilitat dels resultats, per la qual cosa s'ha fet especial insistència en el desenrotllament de prototips sobre sistemes reals al mateix temps que es duia a terme l'estudi teòric. Com a resultat, les propostes d'esta tesi són directament aplicables a sistemes reals, algunes d'elles ja estan sent explotades en la pràctica.<br>Marco Gisbert, H. (2015). Cyber-security protection techniques to mitigate memory errors exploitation [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/57806<br>TESIS
APA, Harvard, Vancouver, ISO, and other styles
6

Govindaraj, Rekha. "Emerging Non-Volatile Memory Technologies for Computing and Security." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7674.

Full text
Abstract:
With CMOS technology scaling reaching its limitations rigorous research of alternate and competent technologies is paramount to push the boundaries of computing. Spintronic and resistive memories have proven to be effective alternatives in terms of area, power and performance to CMOS because of their non-volatility, ability for logic computing and easy integration with CMOS. However, deeper investigations to understand their physical phenomenon and improve their properties such as writability, stability, reliability, endurance, uniformity with minimal device-device variations is necessary for deployment as memories in commercial applications. Application of these technologies beyond memory and logic are investigated in this thesis i.e. for security of integrated circuits and systems and special purpose memories. We proposed a spintonic based special purpose memory for search applications, present design analysis and techniques to improve the performance for larger word lengths upto 256 bits. Salient characteristics of RRAM is studied and exploited in the design of widely accepted hardware security primitives such as Physically Unclonable Function (PUF) and True Random Number Generators (TRNG). Vulnerability of these circuits to adversary attacks and countermeasures are proposed. Proposed PUF can be implemented within 1T-1R conventional memory architecture which offers area advantages compared to RRAM memory and cross bar array PUFs with huge number of challenge response pairs. Potential application of proposed strong arbiter PUF in the Internet of things is proposed and performance is evaluated theoretically with valid assumptions on the maturity of RRAM technology. Proposed TRNG effectively utilizes the random telegraph noise in RRAM current to generate random bit stream. TRNG is evaluated for sufficient randomness in the random bit stream generated. Vulnerability and countermeasures to adversary attacks are also studied. Finally, in thesis we investigated and extended the application of emerging non-volatile memory technologies for search and security in integrated circuits and systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Veca, Matthew. "Extracting Windows event logs using memory forensics." ScholarWorks@UNO, 2015. http://scholarworks.uno.edu/td/2119.

Full text
Abstract:
Abstract Microsoft’s Windows Operating System provides a logging service that collects, filters and stores event messages from the kernel and applications into log files (.evt and .evtx). Volatility, the leading open source advanced memory forensic suite, currently allows users to extract these events from memory dumps of Windows XP and Windows 2003 machines. Currently there is no support for users to extract the event logs (.evtx) from Windows Vista, Win7 or Win8 memory dumps, and Volatility users have to rely on outside software in order to do this. This thesis discusses a newly developed evtxlogs.py plugin for Volatility, which allows users the same functionality with Windows Vista, Win7 and Win8 that they had with Windows XP and Win 2003’s evtlogs.py plugin. The plugin is based on existing mechanisms for parsing Windows Vista-format event logs, but adds fully integrated support for these logs to Volatility.
APA, Harvard, Vancouver, ISO, and other styles
8

Babecki, Christopher. "A Memory-Array Centric Reconfigurable Hardware Accelerator for Security Applications." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1427381331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pettersson, Stefan. "Visualizing Endpoint Security Technologies using Attack Trees." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15509.

Full text
Abstract:
<p>Software vulnerabilities in programs and malware deployments have been increasing almost every year since we started measuring them. Information about how to program securely, how malware shall be avoided and technological countermeasures for this are more available than ever. Still, the trend seems to favor the attacker. This thesis tries to visualize the effects of a selection of technological countermeasures that have been proposed by researchers. These countermeasures: non-executable memory, address randomization, system call interception and file integrity monitoring are described along with the attacks they are designed to defend against. The coverage of each countermeasure is then visualized with the help of attack trees. Attack trees are normally used for describing how systems can be attacked but here they instead serve the purpose of showing where in an attack a countermeasure takes effect. Using attack trees for this highlights a couple of important aspects of a security mechanism, such as how early in an attack it is effective and which variants of an attack it potentially defends against. This is done by the use of what we call defensive codes that describe how a defense mechanism counters a sub-goal in an attack. Unfortunately the whole process is not well formalized and depends on many uncertain factors.</p>
APA, Harvard, Vancouver, ISO, and other styles
10

Payne, Bryan D. "Improving host-based computer security using secure active monitoring and memory analysis." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34852.

Full text
Abstract:
Thirty years ago, research in designing operating systems to defeat malicious software was very popular. The primary technique was to design and implement a small security kernel that could provide security assurances to the rest of the system. However, as operating systems grew in size throughout the 1980's and 1990's, research into security kernels slowly waned. From a security perspective, the story was bleak. Providing security to one of these large operating systems typically required running software within that operating system. This weak security foundation made it relatively easy for attackers to subvert the entire system without detection. The research presented in this thesis aims to reimagine how we design and deploy computer systems. We show that through careful use of virtualization technology, one can effectively isolate the security critical components in a system from malicious software. Furthermore, we can control this isolation to allow the security software a complete view to monitor the running system. This view includes all of the necessary information for implementing useful security applications including the system memory, storage, hardware events, and network traffic. In addition, we show how to perform both passive and active monitoring securely, using this new system architecture. Security applications must be redesigned to work within this new monitoring architecture. The data acquired through our monitoring is typically very low-level and difficult to use directly. In this thesis, we describe work that helps bridge this semantic gap by locating data structures within the memory of a running virtual machine. We also describe work that shows a useful and novel security framework made possible through this new monitoring architecture. This framework correlates human interaction with the system to distinguish legitimate and malicious outgoing network traffic.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Memory security"

1

Oualha, Nouha. Peer-to-peer storage: Security and protocols. Nova Science Publishers, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Michael, Leifer, Liow Joseph Chin Yong, and Emmers Ralf 1974-, eds. Order and security in Southeast Asia: Essays in memory of Michael Leifer. Routledge, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jan, Rohwerder, and Volk Christian, eds. Junge politikwissenschaftliche Perspektiven: Dokumentation der Aachener Herbstgespräche. Kovac̆, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Preston, Catherine L. In retrospect: The construction and communication of a national visual memory. C.L. Preston, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Center for Evaluative and Developmental Research (Aldershot, England), ed. Narrative identity and dementia: A study of autobiographical memories and emotions. Ashgate, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rai, I. Dewa Putu. Memori jabatan Deputi Bidang Politik, Hukum, Pertahanan, dan Keamanan. Kantor Menteri Negara Perencanaan Pembangunan Nasional/Badan Perencanaan Pembangunan Nasional, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sy Savané, Alpha Omar, $4d 1953-. La Guinée, membre permanent du Conseil de sécurité des Nations Unies. L'Harmattan, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Watanabe, Yasushi. Handbook of Cultural Security. Elgar Publishing Limited, Edward, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lelyveld, Joseph. Omaha Blues: A Memory Loop. Farrar, Straus & Giroux, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lawler, Peter, Charlotte Heath-Kelly, and Emmanuel Pierre Guittet. Death and Security: Memory and Mortality at the Bombsite. Manchester University Press, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Memory security"

1

Balasubramonian, Rajeev. "Memory Security." In Innovations in the Memory System. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-031-01763-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Helfrich, James. "Memory Injection." In Security for Software Engineers. Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9780429506475-11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shi, Weidong, Chenghuai Lu, and Hsien-Hsin S. Lee. "Memory-Centric Security Architecture." In High Performance Embedded Architectures and Compilers. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11587514_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shi, Weidong, Chenghuai Lu, and Hsien-Hsin S. Lee. "Memory-Centric Security Architecture." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71528-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Silvestri, Lisa. "Memory, Security, and Communication." In The Handbook of Communication and Security. Routledge, 2019. http://dx.doi.org/10.4324/9781351180962-18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tehranipoor, Mark, Nitin Pundir, Nidish Vashistha, and Farimah Farahmandi. "Volatile Memory-Based PUF." In Hardware Security Primitives. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-19185-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Adiguzel, O. "Thermal Memory and Thermal Induced Phase Transformation in Shape Memory Alloys." In Nanomaterials for Security. Springer Netherlands, 2016. http://dx.doi.org/10.1007/978-94-017-7593-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bae, Seungyeon, Taehun Kim, Woomin Lee, and Youngjoo Shin. "Exploiting Memory Page Management in KSM for Remote Memory Deduplication Attack." In Information Security Applications. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-8024-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Novković, Bojan, and Marin Golub. "SoK: Secure Memory Allocation." In Cryptology and Network Security. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92548-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gotfryd, Karol, Paweł Lorek, and Filip Zagórski. "RiffleScrambler – A Memory-Hard Password Storing Function." In Computer Security. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98989-1_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Memory security"

1

Gorter, Floris, Taddeus Kroes, Herbert Bos, and Cristiano Giuffrida. "Sticky Tags: Efficient and Deterministic Spatial Memory Error Mitigation using Persistent Memory Tags." In 2024 IEEE Symposium on Security and Privacy (SP). IEEE, 2024. http://dx.doi.org/10.1109/sp54263.2024.00263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ajmi, Hala, Fakhreddine Zayer, and Hamdi Belgacem. "In-Memory Computing Architecture for Efficient Hardware Security." In 2024 IEEE 7th International Conference on Advanced Technologies, Signal and Image Processing (ATSIP). IEEE, 2024. http://dx.doi.org/10.1109/atsip62566.2024.10638850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Minjung, and Daejin Park. "Enhancing Microcontroller Security Through Volatile Memory-Resident Encrypted Code." In 2024 IEEE Conference on Dependable and Secure Computing (DSC). IEEE, 2024. http://dx.doi.org/10.1109/dsc63325.2024.00028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vintila, Emanuel Q., Philipp Zieris, and Julian Horsch. "Evaluating the Effectiveness of Memory Safety Sanitizers." In 2025 IEEE Symposium on Security and Privacy (SP). IEEE, 2025. https://doi.org/10.1109/sp61157.2025.00088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hong, Junwha, Wonil Jang, Mijung Kim, Lei Yu, Yonghwi Kwon, and Yuseok Jeon. "CMASan: Custom Memory Allocator-Aware Address Sanitizer." In 2025 IEEE Symposium on Security and Privacy (SP). IEEE, 2025. https://doi.org/10.1109/sp61157.2025.00110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hong, Junwha, Wonil Jang, Mijung Kim, Lei Yu, Yonghwi Kwon, and Yuseok Jeon. "CMASan: Custom Memory Allocator-aware Address Sanitizer." In 2025 IEEE Symposium on Security and Privacy (SP). IEEE, 2025. https://doi.org/10.1109/sp61157.2025.00074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jones, Katharine J. "Wavelet-based associative memory." In Defense and Security, edited by Harold H. Szu, Mladen V. Wickerhauser, Barak A. Pearlmutter, and Wim Sweldens. SPIE, 2004. http://dx.doi.org/10.1117/12.541566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

S, Karthika, and Kavitha A. "Cloud Memory Management with Hybrid Algorithms." In International Conference on Recent Trends in Computing & Communication Technologies (ICRCCT’2K24). International Journal of Advanced Trends in Engineering and Management, 2024. http://dx.doi.org/10.59544/hvrr2284/icrcct24p146.

Full text
Abstract:
Cloud memory management is a critical aspect of efficient data storage and retrieval in cloud computing environments. Hybrid algorithms have emerged as a promising solution to optimize memory management by combining the strengths of different approaches. This abstract explores the integration of hybrid algorithms in cloud memory management to enhance performance and scalability. Hash codes play a crucial role in data integrity verification and security. Comparing the hash codes generated by different algorithms, such as SHA1 and SHA2, provides insights into their efficiency, collision resistance, and cryptographic strength. This comparison aids in selecting the most suitable algorithm for specific security requirements in cloud environments. Data security is paramount in cloud computing, especially when sensitive information is stored or transmitted. Hybrid methods like homomorphic encryption combined with Proxy Re Encryption offer a robust approach to securing data while allowing for secure computation and sharing. This abstract delves into the implementation and benefits of using hybrid methods for enhancing data security in cloud environments. By exploring the integration of hybrid algorithms in cloud memory management, comparing hash codes for SHA1 and SHA2, and leveraging hybrid methods for data security, this abstract aims to provide valuable insights into optimizing cloud computing systems for improved performance, security, and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
9

Hashimoto, Mikio. "Overview of Memory Security Technologies." In 2021 International Symposium on VLSI Technology, Systems and Applications (VLSI-TSA). IEEE, 2021. http://dx.doi.org/10.1109/vlsi-tsa51926.2021.9440133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Falk, Heiko. "Session details: Security in memory." In ESWEEK'12: Eighth Embedded System Week. ACM, 2012. http://dx.doi.org/10.1145/3250258.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Memory security"

1

Pinkerton, J., and E. Deleganes. Direct Data Placement Protocol (DDP) / Remote Direct Memory Access Protocol (RDMAP) Security. RFC Editor, 2007. http://dx.doi.org/10.17487/rfc5042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bikova, E. V. Energy Security and Controlled Power Transimissions, issue 13(28), Proceedings-2022, in memory of academician Postolati V.M. DOI СODE, 2022. http://dx.doi.org/10.18411/doicode-2023.114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pasupuleti, Murali Krishna. Scalable Quantum Networks: Entanglement-Driven Secure Communication. National Education Services, 2025. https://doi.org/10.62311/nesx/rrvi525.

Full text
Abstract:
Abstract: Scalable quantum networks, powered by entanglement-driven secure communication, are poised to revolutionize global information exchange, cybersecurity, and quantum computing infrastructures. Unlike classical communication systems, quantum networks leverage quantum entanglement and superposition to enable ultra-secure data transmission, quantum key distribution (QKD), and instantaneous information sharing across large-scale networks. This research explores the fundamental principles of entanglement-based communication, the role of quantum repeaters, quantum memory, and multi-nodal entanglement distribution in overcoming photon loss, decoherence, and distance limitations in quantum networks. Additionally, it examines the hybrid integration of quantum-classical networking architectures, real-world experimental implementations such as satellite-based quantum communication and metropolitan-scale quantum cryptography, and the scalability challenges related to hardware, error correction, and network synchronization. The study also addresses post-quantum cryptography, quantum-resistant algorithms, and cybersecurity vulnerabilities in quantum communication, offering a comprehensive roadmap for the development of secure, scalable, and globally interconnected quantum networks. Keywords: Scalable quantum networks, quantum entanglement, entanglement distribution, quantum key distribution (QKD), secure communication, quantum repeaters, quantum memory, photon loss mitigation, quantum cryptography, post-quantum security, hybrid quantum-classical networks, metropolitan-scale quantum networks, satellite-based quantum communication, quantum internet, quantum coherence, quantum error correction, quantum teleportation, multi-nodal quantum entanglement, cybersecurity in quantum networks, quantum-resistant algorithms.
APA, Harvard, Vancouver, ISO, and other styles
4

Beer, Richard C. Memo to the President-Elect: An Alternative National Security Strategy for the 21st Century. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada432150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Memory security' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography