Sciweavers

Share
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
7 years 5 months ago
Sketching valuation functions
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu,...
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
7 years 5 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
IACR
2011
128views more  IACR 2011»
8 years 2 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
IACR
2011
173views more  IACR 2011»
8 years 2 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
ASIACRYPT
2011
Springer
8 years 2 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
SIGECOM
2011
ACM
249views ECommerce» more  SIGECOM 2011»
8 years 5 months ago
Leading dynamics to good behavior
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
Maria-Florina Balcan
FOCS
2005
IEEE
9 years 8 months ago
Concurrent Non-Malleable Commitments
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
Rafael Pass, Alon Rosen
books