Sciweavers

250 search results - page 46 / 50
» Improving the Exact Security of Digital Signature Schemes
Sort
View
IJACT
2010
67views more  IJACT 2010»
13 years 1 months ago
On message recognition protocols: recoverability and explicit confirmation
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
EUROPKI
2004
Springer
13 years 10 months ago
On the Synergy Between Certificate Verification Trees and PayTree-like Micropayments
Abstract. A substantial number of micropayment schemes in the literature are based on distributing the cost of a digital signature over several successive micropayments (e.g. Paywo...
Josep Domingo-Ferrer
IACR
2011
221views more  IACR 2011»
12 years 6 months ago
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
Süleyman Kardas, Mehmet Sabir Kiraz, Muhammed...
WS
2003
ACM
14 years 4 days ago
An authentication framework for hierarchical ad hoc sensor networks
Recent results indicate scalability problems for flat ad hoc networks. To address the issue of scalability, self-organizing hierarchical ad hoc architectures are being investigat...
Mathias Bohge, Wade Trappe
EUROCRYPT
2000
Springer
13 years 10 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi