Sciweavers

250 search results - page 26 / 50
» Improving the Exact Security of Digital Signature Schemes
Sort
View
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 2 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 1 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
CCS
2006
ACM
13 years 11 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
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 14 days ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
ACSAC
2009
IEEE
13 years 11 months ago
BAF: An Efficient Publicly Verifiable Secure Audit Logging Scheme for Distributed Systems
Audit logs, providing information about the current and past states of systems, are one of the most important parts of modern computer systems. Providing security for audit logs on...
Attila Altay Yavuz, Peng Ning