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:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241206T130000
DTEND;TZID=America/Los_Angeles:20241206T140000
DTSTAMP:20260424T203721
CREATED:20241008T012801Z
LAST-MODIFIED:20250211T004551Z
UID:2120-1733490000-1733493600@isg.ics.uci.edu
SUMMARY:Binbin Gu: PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL Queries Verification
DESCRIPTION:Abstract:\nIn database applications involving sensitive data\, the dual imperatives of data confidentiality and provable (verifiable) query processing are important. This paper introduces PoneglyphDB\, a database system that leverages non-interactive zero-knowledge proofs (ZKP) to support both confidentiality and provability. Unlike traditional databases\, PoneglyphDB enhances confidentiality by ensuring that raw data remains exclusively with the host\, while also enabling verifying the correctness of query responses by providing proofs to clients. \nThe main innovation in this paper is proposing efficient ZKP designs (called circuits) for basic operations in SQL query processing. These basic operation circuits are then combined to form ZKP circuits for larger\, more complex queries. PoneglyphDB’s circuits are \ncarefully designed to be efficient by utilizing advances in cryptography such as PLONKish-based circuits\, recursive proof composition techniques\, and designing with low-order polynomial constraints. We demonstrate the performance of PoneglyphDB with the standard TPC-H benchmark. Our experimental results show that PoneglyphDB can efficiently achieve both confidentiality and provability\, outperforming existing state-of-the-art ZKP methods.
URL:https://isg.ics.uci.edu/event/binbin-gu-tbd/
LOCATION:DBH 3011
END:VEVENT
END:VCALENDAR