Sciweavers

401 search results - page 69 / 81
» Delegatable Functional Signatures
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
AOSD
2008
ACM
13 years 9 months ago
StrongAspectJ: flexible and safe pointcut/advice bindings
AspectJ was designed as a seamless aspect-oriented extension of the Java programming language. However, unlike Java, AspectJ does not have a safe type system: an accepted binding ...
Bruno De Fraine, Mario Südholt, Viviane Jonck...
ASIACRYPT
2008
Springer
13 years 9 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
BIRTHDAY
2010
Springer
13 years 8 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
IEICET
2008
119views more  IEICET 2008»
13 years 7 months ago
Universally Composable Identity-Based Encryption
Abstract-- The identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-...
Ryo Nishimaki, Yoshifumi Manabe, Tatsuaki Okamoto