762 search results - page 130 / 153 » How to realize |
143
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Personalized support for learners becomes even more important, when e-Learning takes place in open and dynamic learning and information networks. This paper shows how to realize p...
136
click to vote
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
129
click to vote
IACR
2011
14 years 3 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
133
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
158
click to vote
TVLSI
2008
15 years 3 months ago
2008
The on-chip communication architecture is a major determinant of overall performance in complex System-on-Chip (SoC) designs. Since the communication requirements of SoC components...