BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1531
DTSTAMP:20250227T044058Z
SUMMARY:Black-Box Commit-and-Prove Protocols
DESCRIPTION:Speaker: Ratnakar Medepalli (TIFR)\n\nAbstract: \nCommit-and-Pr
 ove protocols allow one party to commit to a value and prove that the valu
 e satisfies a given predicate\, while ensuring that this value remains hid
 den. Such protocols are often used in the construction of MPC protocols. B
 lack-box commit-and-prove protocols are those that use the composite primi
 tives without looking at the underlying code\, and are often preferred due
  to efficiency reasons. One salient measure of the complexity of such prot
 ocols is the number of rounds of communication.\n \nIn this talk\, we wil
 l see a three-round commit-and-prove protocol by Hazay and Venkitasubraman
 iam that satisfies constant soundness and zero-knowledge. We will also see
  the construction by Khurana\, Ostrovsky and Srinivasan that boosts the so
 undness when the zero knowledge requirement is relaxed to witness-indistin
 guishability.\n \nReferences:\n \n1. On the Power of Secure Two-Party Co
 mputation\n \n2. Round Optimal Black-Box "Commit-and-Prove"\n
URL:https://www.tcs.tifr.res.in/web/events/1531
DTSTART;TZID=Asia/Kolkata:20250228T160000
DTEND;TZID=Asia/Kolkata:20250228T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR