BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250625T183020Z
LOCATION:Level 3 Lobby
DTSTART;TZID=America/Los_Angeles:20250622T180000
DTEND;TZID=America/Los_Angeles:20250622T190000
UID:dac_DAC 2025_sess261_RESEARCH1697@linklings.com
SUMMARY:SafeSSD: Treeless SSD Protection by Leveraging Physical Address as
  Version Number
DESCRIPTION:Talha Ahmed and Seokin Hong (Sungkyunkwan University)\n\nData 
 security is critical for protecting valuable data, especially in environme
 nts that demand strict data integrity and confidentiality protection. Whil
 e memory security has been extensively studied, SSD security remains under
 explored despite its growing importance. Recent approaches often adapt mem
 ory-focused techniques, such as Merkle tree-based protection, to SSDs, lea
 ding to significant overhead from metadata transfers between SSD controlle
 rs and NAND Flash devices.  Additionally, existing solutions often focus s
 olely on data-at-rest encryption, neglecting the equally critical issue of
  securing data in transit.\nThis paper introduces a treeless SSD security 
 mechanism by utilizing the out-of-place update property of NVMe-based SSDs
  where the physical address (PA) changes with each write.  By leveraging P
 A as a timestamp, our approach eliminates the need for counter and Merkle 
 tree, significantly reducing metadata storage requirements by 1.2x and tri
 ggered flash commands by 0.52x. This includes a notable 1.8x reduction in 
 program commands, which extends flash cell endurance. These improvements r
 esult in a 2.2x reduction in latency directly accelerates the execution ti
 me by 6.7x. Additionally, we show a 0.1x increase in throughput over the c
 losest competing work.\n\n
END:VEVENT
END:VCALENDAR