Sciweavers

1769 search results - page 203 / 354
» Cryptography
Sort
View
103
Voted
CIE
2008
Springer
15 years 5 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
125
Voted
PQCRYPTO
2010
149views Cryptology» more  PQCRYPTO 2010»
15 years 5 months ago
Properties of the Discrete Differential with Cryptographic Applications
Abstract. Recently, the Csignature scheme has been completely broken by Dubois et al. [2, 3]. As a consequence, the security of SFLASH and other multivariate public key systems hav...
Daniel Smith-Tone
FC
2008
Springer
97views Cryptology» more  FC 2008»
15 years 5 months ago
OpenPGP-Based Financial Instruments and Dispute Arbitration
In this paper, we present some guidelines for implementing various financial instruments for the purposes of credit and payment, including protocols for commercial transactions, di...
Daniel A. Nagy, Nadzeya V. Shakel
ICISC
2007
125views Cryptology» more  ICISC 2007»
15 years 5 months ago
A Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
Antoine Scemama
SICHERHEIT
2008
15 years 5 months ago
Efficiency Improvement for NTRU
Abstract: The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardne...
Johannes Buchmann, Martin Döring, Richard Lin...