BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250523T130000
DTEND;TZID=America/Los_Angeles:20250523T140000
DTSTAMP:20260424T074056
CREATED:20250401T172015Z
LAST-MODIFIED:20250521T185546Z
UID:2198-1748005200-1748008800@isg.ics.uci.edu
SUMMARY:Binbin Gu: PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
DESCRIPTION:Abstract:\nAs databases increasingly serve as backbones for sensitive applications\, ensuring both data confidentiality and computational integrity becomes critical—especially when the data owner and querier do not fully trust each other. In this talk\, I will introduce PoneglyphDB\, a novel database system that generates non-interactive zero-knowledge proofs (ZKPs) for arbitrary SQL queries\, allowing users to verify query results without seeing the underlying data. PoneglyphDB tackles key limitations of prior interactive ZKP systems by compiling SQL operators into efficient PLONKish arithmetic circuits\, optimizing them with low-degree polynomial constraints\, recursive proof composition\, and oblivious execution. The system supports a rich set of SQL operations including joins\, aggregations\, group-by\, and even string predicates\, while achieving significant performance improvements over state-of-the-art systems like ZKSQL and Libra. I will detail the system architecture\, circuit compiler\, and experimental results on the TPC-H benchmark\, showing how PoneglyphDB bridges theory and practice for verifiable\, privacy-preserving data processing. \nBio:\nBinbin Gu is a final-year Ph.D. candidate in Computer Science at the University of California\, Irvine\, advised by Faisal Nawab. His research lies at the intersection of trustworthy AI\, database systems\, and cryptographic verification.
URL:https://isg.ics.uci.edu/event/janki-bhimani-fiu/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR