Sciweavers

77 search results - page 9 / 16
» How to Achieve a McEliece-Based Digital Signature Scheme
Sort
View
ECCC
2007
185views more  ECCC 2007»
14 years 9 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
94
Voted
ACNS
2006
Springer
167views Cryptology» more  ACNS 2006»
15 years 1 months ago
Public Key Cryptography Sans Certificates in Ad Hoc Networks
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
Nitesh Saxena
PODC
1998
ACM
15 years 1 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...
ADHOC
2008
132views more  ADHOC 2008»
14 years 9 months ago
Defending against cache consistency attacks in wireless ad hoc networks
Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, the issue of cache consistency must be addres...
Wensheng Zhang, Guohong Cao
EUROCRYPT
2010
Springer
15 years 2 months ago
Cryptographic Agility and Its Relation to Circular Encryption
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...
Tolga Acar, Mira Belenkiy, Mihir Bellare, David Ca...