Sciweavers

352 search results - page 60 / 71
» Cryptography in the Multi-string Model
Sort
View
ECIS
2000
13 years 11 months ago
Retailing Digital Products
Current research activities in the area of trading digital products usually focus on specific legal or technical problems, neglecting the underlying business models and their impl...
Redmer Luxem, Lars H. Ehlers
EUROCRYPT
2003
Springer
14 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 10 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
ACNS
2008
Springer
138views Cryptology» more  ACNS 2008»
14 years 4 months ago
Traceable and Retrievable Identity-Based Encryption
Abstract. Very recently, the concept of Traceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption scheme) was introduced in Crypto 2007. ...
Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susil...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
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...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai