62 search results - page 11 / 13 » Groth-Sahai Proofs Revisited |
101
Voted
CEC
2010
IEEE
14 years 12 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
FM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
CF
2004
ACM
15 years 4 months ago
2004
ACM
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
CRYPTO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
CRYPTO
2003
Springer
15 years 4 months ago
2003
Springer
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...