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:20260402T024533Z
LOCATION:3002\, Level 3
DTSTART;TZID=America/Los_Angeles:20250625T104500
DTEND;TZID=America/Los_Angeles:20250625T110000
UID:dac_DAC 2025_sess149_RESEARCH2566@linklings.com
SUMMARY:zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computi
 ng
DESCRIPTION:Yancheng Zhang and Mengxin Zheng (University of Central Florid
 a), xun chen (Samsung), Jingtong Hu (University of Pittsburgh), Weidong Sh
 i (University of Houston), Lei Ju (Shandong University), and Yan Solihin a
 nd Qian Lou (University of Central Florida)\n\nIn the context of cloud com
 puting, services are held on cloud servers, where the clients send their d
 ata to the server and obtain the results returned by server. However, the 
 computation, data and results are prone to tampering due to the vulnerabil
 ities on the server side. Thus, verifying the integrity of computation is 
 important in the client-server setting. The cryptographic method known as 
 Zero-Knowledge Proof (ZKP) is renowned for facilitating private and verifi
 able computing. ZKP allows the client to validate that the results from th
 e server are computed correctly without violating the privacy of the serve
 r's intellectual property. Zero-Knowledge Succinct Non-Interactive Argumen
 t of Knowledge (zkSNARKs), in particular, has been widely applied in vario
 us applications like blockchain and verifiable machine learning. Despite t
 heir popularity, existing zkSNARKs approaches remain highly computationall
 y intensive. For instance, even basic operations like matrix multiplicatio
 n require an extensive number of constraints, resulting in significant ove
 rhead. In addressing this challenge, we introduce \textit{zkVC}, which opt
 imizes the ZKP computation for matrix multiplication, enabling rapid proof
  generation on the server side and efficient verification on the client si
 de. zkVC integrates optimized ZKP modules, such as Constraint-reduced Poly
 nomial Circuit (CRPC) and Prefix-Sum Query (PSQ), collectively yielding a 
 more than 12-fold increase in proof speed over prior methods. The code is 
 available at https://anonymous.4open.science/r/zkformer-5E69/\n\nTopics: S
 ecurity\n\nTracks: SEC1: AI/ML Security/Privacy\n\nSession Chairs: Jack Mi
 skelly (Queen's University Belfast) and Stefano Di Carlo (Politecnico di T
 orino)\n\n
END:VEVENT
END:VCALENDAR