1834 search results - page 110 / 367 » Public Key Cryptography |
TCC
2010
Springer
15 years 8 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
TCC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who...
STOC
2007
ACM
15 years 11 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
107
click to vote
ACMICEC
2003
ACM
15 years 4 months ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
PKC
2000
Springer
15 years 2 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...