Sciweavers

2967 search results - page 161 / 594
» Cryptology
Sort
View
CRYPTO
2008
Springer
109views Cryptology» more  CRYPTO 2008»
15 years 9 months ago
Adaptive One-Way Functions and Applications
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
15 years 9 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
Andrew Y. Lindell
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
15 years 9 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»
15 years 9 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
EUROCRYPT
2008
Springer
15 years 9 months ago
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Predicate encryption is a new paradigm for public-key encryption generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys corresp...
Jonathan Katz, Amit Sahai, Brent Waters