Sciweavers

1769 search results - page 285 / 354
» Cryptography
Sort
View
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
14 years 1 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
14 years 1 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
DSN
2004
IEEE
14 years 1 months ago
Secure Distributed DNS
A correctly working Domain Name System (DNS) is essential for the Internet. Due to its significance and because of deficiencies in its current design, the DNS is vulnerable to a w...
Christian Cachin, Asad Samar
CCS
2006
ACM
14 years 1 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven
CHES
2006
Springer
134views Cryptology» more  CHES 2006»
14 years 1 months ago
Read-Proof Hardware from Protective Coatings
In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient beca...
Pim Tuyls, Geert Jan Schrijen, Boris Skoric, Jan v...