Sciweavers

22 search results - page 3 / 5
» A Signcryption Scheme Based on Integer Factorization
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 10 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
EUROCRYPT
1999
Springer
13 years 11 months ago
Computationally Private Information Retrieval with Polylogarithmic Communication
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
Christian Cachin, Silvio Micali, Markus Stadler
ACISP
2000
Springer
13 years 12 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
ACISP
2001
Springer
14 years 10 hour ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito
CRYPTO
2004
Springer
127views Cryptology» more  CRYPTO 2004»
14 years 27 days ago
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
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...
Dario Catalano, David Pointcheval, Thomas Pornin