Sciweavers

132 search results - page 20 / 27
» New and improved constructions of non-malleable cryptographi...
Sort
View
ICS
2010
Tsinghua U.
14 years 5 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ECCC
2010
98views more  ECCC 2010»
13 years 6 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
CRYPTO
2004
Springer
123views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Asymptotically Optimal Communication for Torus-Based Cryptography
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
Marten van Dijk, David P. Woodruff
EUROCRYPT
2008
Springer
13 years 9 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
FC
2010
Springer
230views Cryptology» more  FC 2010»
13 years 11 months ago
Multiple Denominations in E-cash with Compact Transaction Data
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
Sébastien Canard, Aline Gouget