NDLI: Efficiency improvements for signature schemes with tight security reductions

Please wait, while we are loading the content...

Privacy cognizant information systems

DoS protection for UDP-based protocols

A pairwise key pre-distribution scheme for wireless sensor networks

XML access control using static analysis

The blocker tag: selective blocking of RFID tags for consumer privacy

On the performance, feasibility, and use of forward-secure signatures

Incentive-based modeling and inference of attacker intent, objectives, and strategies

Automatic generation of two-party computations

Anomaly detection of web-based attacks

Obfuscation of executable code to improve resistance to static disassembly

MECA: an extensible, expressive system and language for statically checking security properties

Using graphic turing tests to counter automated DDoS attacks against web servers

Establishing pairwise keys in distributed sensor networks

On permissions, inheritance and role hierarchies

Receiver anonymity via incomparable public keys

Print signatures for document authentication

Monitoring and early warning for internet worms

A composable cryptographic library with nested operations

Enhancing byte-level network intrusion detection signatures with context

PPay: micropayments for peer-to-peer systems

CDiff: a new reduction technique for constraint-based analysis of security protocols

Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays

LEAP: efficient security mechanisms for large-scale distributed sensor networks

Balancing confidentiality and efficiency in untrusted relational DBMSs

k-anonymous message transmission

Efficiency improvements for signature schemes with tight security reductions

Learning attack strategies from intrusion alerts

Efficient self-healing group key distribution with revocation capability

Countering code-injection attacks with instruction-set randomization

A new CRT-RSA algorithm secure against bellcore attacks

Buffer overrun detection using linear programming and static analysis

Hop-count filtering: an effective defense against spoofed DDoS traffic

Origin authentication in interdomain routing

Security proofs for an efficient password-based key exchange

Randomized instruction set emulation to disrupt binary code injection attacks

Cryptographic tamper evidence

Efficiency improvements for signature schemes with tight security reductions

Content Provider	ACM Digital Library
Author	Katz, Jonathan Wang, Nan
Abstract	Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes:Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33% more efficient and signatures are 75% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem.PSS. The probabilistic signature scheme (PSS) designed by Bellare and Rogaway [3] uses a random salt to enable a tight security reduction to, e.g., the RSA problem. Coron [12] subsequently showed that a shorter random salt can be used without impacting the security of the scheme. We show a variant of PSS which avoids the random salt altogether yet has an equally-tight security reduction. This furthermore yields a version of PSS-R (PSS with message recovery) with optimal message length. Our technique may also be used to improve the efficiency of a number of other schemes.
Starting Page	155
Ending Page	164
Page Count	10
File Format	PDF
ISBN	1581137389
DOI	10.1145/948109.948132
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-10-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Digital signatures
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficiency Improvements for Signature Schemes with Tight Security Reductions (2003)

Efficiency improvements for signature schemes with tight security reductions (2003).

New Signature Schemes with Tight Security Reductions

A CDH-Based Multi-Signature Scheme with Tight Security Reduction

Tightly-Secure Signatures from Lossy Identification Schemes

Some aggregate forward-secure signature schemes

Schemes for Digital Signing Key Sharing

Secure Routing Protocols for Sensor Networks: Construction with Signature Schemes for Multiple Signers

Provably Secure Structured Signature Schemes with Tighter Reductions

Efficiency improvements for signature schemes with tight security reductions

Similar Documents

Efficiency Improvements for Signature Schemes with Tight Security Reductions (2003)

Efficiency improvements for signature schemes with tight security reductions (2003).

New Signature Schemes with Tight Security Reductions

A CDH-Based Multi-Signature Scheme with Tight Security Reduction

Tightly-Secure Signatures from Lossy Identification Schemes

Some aggregate forward-secure signature schemes

Schemes for Digital Signing Key Sharing

Secure Routing Protocols for Sensor Networks: Construction with Signature Schemes for Multiple Signers

Provably Secure Structured Signature Schemes with Tighter Reductions

Efficiency improvements for signature schemes with tight security reductions