Sciweavers

19 search results - page 2 / 4
» ctrsa 2008
Sort
View
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
13 years 6 months ago
A Latency-Free Election Scheme
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
Kristian Gjøsteen
CTRSA
2008
Springer
172views Cryptology» more  CTRSA 2008»
13 years 6 months ago
CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
We propose two constructions of chosen-ciphertext secure identity-based encryption (IBE) schemes. Our schemes have a security proof in the standard model, yet they offer performan...
Eike Kiltz, Yevgeniy Vahlis
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
13 years 6 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
CTRSA
2008
Springer
113views Cryptology» more  CTRSA 2008»
13 years 6 months ago
Aggregate Message Authentication Codes
We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on ...
Jonathan Katz, Andrew Y. Lindell
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
13 years 6 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell