Sciweavers

570 search results - page 51 / 114
» Black-box constructions for secure computation
Sort
View
IEEECIT
2010
IEEE
13 years 6 months ago
Efficient Sharing of Secure Cloud Storage Services
Suppose Bob, the boss in Company A, pays a secure cloud storage service and authorizes all the employees in that company to share such a service. There exists a user hierarchy: Bob...
Qin Liu, Guojun Wang, Jie Wu
SIGADA
1998
Springer
14 years 7 days ago
Looking into Safety with the Safety and Security Rapporteur Group
The requirements of High Integrity safety-critical, secure and mission-critical Software force developers to use specialised development techniques. Often the choice of computer l...
Stephen Michell, Mark Saaltink, Brian A. Wichmann
EUROPKI
2004
Springer
14 years 1 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
ESOP
2005
Springer
14 years 1 months ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 16 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård