Sciweavers

27 search results - page 4 / 6
» Adaptively Secure Puncturable Pseudorandom Functions in the ...
Sort
View
CCS
1999
ACM
13 years 11 months ago
Signature Schemes Based on the Strong RSA Assumption
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
Ronald Cramer, Victor Shoup
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
14 years 2 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
ASIACRYPT
2010
Springer
13 years 5 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
EUROPAR
2007
Springer
13 years 9 months ago
Evaluation of a Utility Computing Model Based on the Federation of Grid Infrastructures
Utility computing is a service provisioning model which will provide adaptive, flexible and simple access to computing resources, enabling a pay-per-use model for computing simila...
Constantino Vázquez, Eduardo Huedo, Rub&eac...
AAAI
2000
13 years 8 months ago
Adaptive User Interfaces through Dynamic Design Automation
The inherent difficulty in supporting human usability in large control systems--such as building environmental and security systems--derives from the large diversity of components...
Robin R. Penner, Erik S. Steinmetz, Christopher L....