Sciweavers

103 search results - page 5 / 21
» Unconditionally secure cryptosystems based on quantum crypto...
Sort
View
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
13 years 12 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
DATE
2008
IEEE
140views Hardware» more  DATE 2008»
14 years 1 months ago
FPGA Design for Algebraic Tori-Based Public-Key Cryptography
Algebraic torus-based cryptosystems are an alternative for Public-Key Cryptography (PKC). It maintains the security of a larger group while the actual computations are performed i...
Junfeng Fan, Lejla Batina, Kazuo Sakiyama, Ingrid ...
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 29 days ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
EUROCRYPT
2005
Springer
14 years 1 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...