76 search results - page 13 / 16 » Confirmer Signature Schemes Secure against Adaptive Adversar... |
192
click to vote
IACR
2011
14 years 6 months ago
2011
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...
191
click to vote
INDOCRYPT
2003
Springer
15 years 12 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
175
click to vote
ASIACRYPT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
159
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
217
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...