95 search results - page 16 / 19 » Bounded CCA2-Secure Encryption |
CRYPTO
2008
Springer
13 years 8 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
GIS
2009
ACM
14 years 7 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
IACR
2011
12 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...