Browsing FAS Scholarly Articles by Keyword "zero-knowledge proofs"
Now showing items 1-2 of 2
-
Achieving Trust without Disclosure: Dark Pools and a Role for Secrecy-Preserving Verification
(2015)Can an exchange be “dark,” so that orders are not displayed, while simultaneously trustworthy, so that the execution of trades and flow of information occur as promised? SEC actions against dark pools suggest cause for ... -
On Transformations of Interactive Proofs that Preserve the Prover's Complexity
(Association for Computing Machinery, 2000)Goldwasser and Sipser [GS89] proved that every interactive proof system can be transformed into a public-coin one (a.k.a., an Arthur-Merlin game). Their transformation has the drawback that the computational complexity of ...