NDLI: Forgery-resilience for digital signature schemes

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

Protection, usability and improvements in reflected XSS filters

Ciphertext policy attribute-based encryption from lattices

Forgery-resilience for digital signature schemes

Adding query privacy to robust DHTs

Private and oblivious set and multiset operations

CARMA: a hardware tamper-resistant isolated execution environment on commodity x86 platforms

User-level secure deletion on log-structured file systems

AdDroid: privilege separation for applications and advertisers in Android

Towards efficient proofs of retrievability

A closer look at keyboard acoustic emanations: random passwords, typing styles and decoding techniques

An independent validation of vulnerability discovery models

Expressive CP-ABE with partially hidden access structures

Verifier-local revocation group signatures with time-bound keys

On sampling, anonymization, and differential privacy or, k-anonymization meets differential privacy

Practical client puzzles in the standard model

CloudER: a framework for automatic software vulnerability location and patching in the cloud

ClusterFA: a memory-efficient DFA structure for network intrusion detection

Constraint-enhanced role engineering via answer set programming

Boosting efficiency and security in proof of ownership for deduplication

Letting applications operate through attacks launched from compromised drivers

Virtual browser: a virtualized browser to sandbox third-party JavaScripts with enhanced security

New time-memory-data trade-off attack on the estream finalists and modes of operation of block ciphers

An identity authentication protocol in online social networks

Privacy-preserving alibi systems

Towards the attacker's view of protocol narrations (or, how to compile security protocols)

Monetizing spambot activity and understanding its relation with spambot traffic features

Discovering records of private VoIP calls without wiretapping

Integrity walls: finding attack surfaces from mandatory access control policies

Secure cloud maintenance: protecting workloads against insider attacks

Software decoys for insider threat

Memoirs of a browser: a cross-browser detection model for privacy-breaching extensions

An efficient broadcast attack against NTRU

On the mixing time of directed social graphs and security implications

Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model

Carving secure wi-fi zones with defensive jamming

Adaptive semi-private email aliases

The specification and compilation of obligation policies for program monitoring

Outsourced private set intersection using homomorphic encryption

Coercion resistance in authentication responsibility shifting

FlashOver: automated discovery of cross-site scripting vulnerabilities in rich internet applications

Recursive partitioning and summarization: a practical framework for differentially private data publishing

Keeping identity secret in online social networks

CL-PRE: a certificateless proxy re-encryption scheme for secure data sharing with public cloud

PassMap: a map based graphical-password authentication system

Key-insulated symmetric key cryptography and mitigating attacks against cryptographic cloud software

Security implications in Kerberos by the introduction of smart cards

KoNKS: konsensus-style network koordinate system

Forgery-resilience for digital signature schemes

Content Provider	ACM Digital Library
Author	Mashatan, Atefeh Ouafi, Khaled
Abstract	We introduce the notion of forgery-resilience for digital signature schemes, a new paradigm exhibiting desirable legislative properties. It evolves around the idea that, for any message, there can only be a unique valid signature, and exponentially many acceptable signatures, all but one of them being spurious. This primitive enables a judge to verify whether an alleged forged signature is indeed a forgery. In particular, the scheme considers an adversary who has access to a signing oracle and an oracle that solves a "hard" problem, and who tries to produce a signature that appears to be acceptable from a verifier's point of view. However, a judge can tell apart such a spurious signature from a legitimate signature. This property is referred to as validatibility. Moreover, the scheme provides undeniability against malicious signers who try to fabricate spurious signatures and deny them later by showing that they are not valid. Last but not least, trustability refers to the inability of a malicious judge trying to forge a valid signature. This notion for signature schemes improves upon the notion of fail-stop signatures in different ways. For example, it is possible to sign more than one messages with forgery-resilient signatures and once a forgery is found, the credibility of a previously signed signature is not under question. A concrete instance of a forgery-resilient signature scheme is constructed based on the hardness of extracting roots of higher residues, which we show to be equivalent to the factoring assumption. In particular, using collision-free accumulators, we present a tight reduction from malicious signers to adversaries against the factoring problem. Meanwhile, a secure pseudorandom function ensures that no polynomially-bounded cheating verifier, who can still solve hard problems, is able to forge valid signatures. Security against malicious judges is based on the RSA assumption.
Starting Page	24
Ending Page	25
Page Count	2
File Format	PDF
ISBN	9781450316484
DOI	10.1145/2414456.2414469
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-05-02
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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