Sciweavers

743 search results - page 107 / 149
» Secure Signature Schemes based on Interactive Protocols
Sort
View
EUROCRYPT
2009
Springer
14 years 8 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
TWC
2008
156views more  TWC 2008»
13 years 7 months ago
Secure and Fault-Tolerant Event Boundary Detection in Wireless Sensor Networks
Event boundary detection is in and of itself a useful application in wireless sensor networks (WSNs). Typically, it includes the detection of a large-scale spatial phenomenon such ...
Kui Ren, Kai Zeng, Wenjing Lou
EUROCRYPT
2007
Springer
14 years 1 months ago
Divisible E-Cash Systems Can Be Truly Anonymous
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2L that he can parceled and spend anonymously and unlinkably. ...
Sébastien Canard, Aline Gouget
CORR
2010
Springer
87views Education» more  CORR 2010»
13 years 6 months ago
Quantum money from knots
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
Edward Farhi, David Gosset, Avinatan Hassidim, And...
PODC
1998
ACM
13 years 11 months ago
Optimal Efficiency of Optimistic Contract Signing
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
Birgit Pfitzmann, Matthias Schunter, Michael Waidn...