Sciweavers

989 search results - page 162 / 198
» Pebbling and Proofs of Work
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
WINE
2009
Springer
178views Economy» more  WINE 2009»
16 years 26 days ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 26 days ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
IFIP
2009
Springer
16 years 25 days ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
16 years 19 days ago
Restricted Queries over an Encrypted Index with Applications to Regulatory Compliance
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
Nikita Borisov, Soumyadeb Mitra