search for: 184466

...each call. We will experiment with both caller- and callee-saved registers to determine which is most efficient. [1] M. Backes and S. Nürnberger. Oxymoron - making fine-grained memory randomization practical by allowing code sharing. In USENIX Security Symposium, 2014. https://www.usenix.org/node/184466 [2] S. Crane, A. Homescu, and P. Larsen. Code randomization: Haven’t we solved this problem yet? In IEEE Cybersecurity Development Conference (SecDev), 2016. http://www.ics.uci.edu/~perl/sd16_pagerando.pdf

...callee-saved registers to determine which is >> most efficient. >> >> >> [1] M. Backes and S. Nürnberger. Oxymoron - making fine-grained memory >> randomization practical by allowing code sharing. In USENIX Security >> Symposium, 2014. https://www.usenix.org/node/184466 >> >> [2] S. Crane, A. Homescu, and P. Larsen. Code randomization: Haven’t >> we solved this problem yet? In IEEE Cybersecurity Development >> Conference (SecDev), 2016. >> http://www.ics.uci.edu/~perl/sd16_pagerando.pdf >> _______________________________________...

...>> most efficient. > >>> > >>> > >>> [1] M. Backes and S. Nürnberger. Oxymoron - making fine-grained memory > >>> randomization practical by allowing code sharing. In USENIX Security > >>> Symposium, 2014. https://www.usenix.org/node/184466 > >>> > >>> [2] S. Crane, A. Homescu, and P. Larsen. Code randomization: Haven’t > >>> we solved this problem yet? In IEEE Cybersecurity Development > >>> Conference (SecDev), 2016. > >>> http://www.ics.uci.edu/~perl/sd16_pagerando.pdf &gt...

...t;>> >>> >>> [1] M. Backes and S. Nürnberger. Oxymoron - making fine-grained >>> >>> memory >>> >>> randomization practical by allowing code sharing. In USENIX Security >>> >>> Symposium, 2014. https://www.usenix.org/node/184466 >>> >>> >>> >>> [2] S. Crane, A. Homescu, and P. Larsen. Code randomization: Haven’t >>> >>> we solved this problem yet? In IEEE Cybersecurity Development >>> >>> Conference (SecDev), 2016. >>> >>> http://www....