Sciweavers

144 search results - page 9 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
ASIACRYPT
2010
Springer
13 years 5 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
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
ESORICS
2008
Springer
13 years 9 months ago
Symmetric Key Approaches to Securing BGP - A Little Bit Trust Is Enough
The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol that connects autonomous systems (ASes). Despite its importance for the Internet infrastructure, BGP...
Bezawada Bruhadeshwar, Sandeep S. Kulkarni, Alex X...
EUROCRYPT
2006
Springer
13 years 11 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
ITNG
2007
IEEE
14 years 1 months ago
An Improved Signcryption Scheme and Its Variation
Signcryption is a new cryptographic primitive which simultaneously provides both confidentiality and authenticity. This paper proposes an improved signcryption scheme and a varia...
Raylin Tso, Takeshi Okamoto, Eiji Okamoto