Sciweavers

193 search results - page 33 / 39
» Fair Public-Key Cryptosystems
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
SCN
2008
Springer
13 years 7 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
EJWCN
2010
115views more  EJWCN 2010»
13 years 2 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
EUROCRYPT
1995
Springer
13 years 11 months ago
Fair Blind Signatures
Abstract. A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-...
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
DRM
2004
Springer
14 years 1 months ago
A DRM security architecture for home networks
This paper describes a security architecture allowing digital rights management in home networks consisting of consumer electronic devices. The idea is to allow devices to establi...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...