Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications

Authors:
Michael O. Rabin;Rocco A. Servedio;Christopher Thorpe
Affiliations:
Harvard University, USA;Columbia University, USA;Harvard University, USA
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 5

Practical secrecy-preserving, verifiably correct and trustworthy auctions

Electronic Commerce Research and Applications
Private and verifiable interdomain routing decisions

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Strictly-black-box zero-knowledge and efficient validation of financial transactions

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Private and verifiable interdomain routing decisions

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Verifiable auctions for online ad exchanges

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decidability of equality is proved for Martin-Lof type theory with a universe á la Russell and typed beta-eta- equality judgements. A corollary of this result is that the constructor for dependent function types is injective, a property which ...