NDLI: Scalable public-key tracing and revoking

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

Cryptography and competition policy: issues with 'trusted computing'

Working with mike on distributed computing theory, 1978--1992

Simple and fast optimistic protocols for fair electronic exchange

Fischer's cryptographic protocols

Constant-time distributed dominating set approximation

Distributed error confinement

Compact roundtrip routing with topology-independent node names

A new approach to on-demand loop-free routing in ad hoc networks

Geometric ad-hoc routing: of theory and practice

Broadcasting in undirected ad hoc radio networks

Brief announcement: cluster-based control mechanism for communication networks

Operation-valency and the cost of coordination

Software transactional memory for dynamic-sized data structures

Split-ordered lists: lock-free extensible hash tables

Brief announcement: concurrent counting is harder than queuing

Brief announcement: dynamic group communication

Scalable and dynamic quorum systems

Peer-to-peer systems for prefix search

Routing networks for distributed hash tables

Asynchronous resource discovery

Brief announcement: an overview of the content-addressable network D2B

Brief announcement: deterministic skipnet

An asynchronous protocol for distributed computation of RSA inverses and its applications

Efficient revocation and threshold pairing based cryptosystems

Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures

Oblivious signature-based envelope

Scalable public-key tracing and revoking

Brief announcement: impossibility results for concurrent secure two-party computation

Brief announcement: a method for exchanging valuable data: how to realize matching oblivious transfer

Distributed consensus in the presence of sectional faults

Efficient player-optimal protocols for strong and differential consensus

tight bounds for k-set agreement with limited-scope failure detectors

Brief announcement: early decision despite general process omission failures

Proactive secure message transmission in asynchronous networks

Efficient reliable communication over partially authenticated networks

Algorithms for dynamic multicast key distribution trees

Brief announcement: efficient perfectly secure communication over synchronous networks

Brief announcement: building data structures on untrusted peer-to-peer storage with per-participant logs

Brief announcement: extending SQL access control to derived and distributed data

A work-optimal deterministic algorithm for the asynchronous certified write-all problem

Performing work with asynchronous processors: message-delay-sensitive bounds

Fair group mutual exclusion

Efficient and practical constructions of LL/SC variables

Adaptive and efficient abortable mutual exclusion

Automatic discovery of mutual exclusion algorithms

On implementing omega with weak reliability and synchrony assumptions

On using network attached disks as shared memory

A lattice-theoretic characterization of safety and liveness

Brief announcement: branching time refinement

Brief announcement: efficient replication of large data objects

Brief announcement: efficient flooding in power-law networks

Scaling properties of the Internet graph

On a network creation game

Adaptive AIMD congestion control

Adapting to a reliable network path

Scalable public-key tracing and revoking

Content Provider	ACM Digital Library
Author	Dodis, Yevgeniy Kiayias, Aggelos Yung, Moti Fazio, Nelly
Abstract	Traitor Tracing Schemes constitute a very useful tool against piracy in the context of digital content broadcast. In such multi-recipient encryption schemes, each decryption key is fingerprinted and when a pirate decoder is discovered, the authorities can trace the identities of the users that contributed in its construction (called traitors). Public-key traitor tracing schemes allow for a multitude of non trusted content providers using the same set of keys, which makes the scheme "server-side scalable." To make such schemes also "client-side scalable," i.e. long lived and usable for a large population of subscribers that changes dynamically over time, it is crucial to implement efficient Add-user and Remove-user operations. Previous work on public-key traitor tracing did not address this dynamic scenario thoroughly, and there is no efficient scalable public key traitor tracing scheme that allows an increasing number of Add-user and Remove-user operations.To address these issues, we introduce the model of Scalable Public-Key Traitor Tracing, and present the first construction of such a scheme. Our model mandates for deterministic traitor tracing and an unlimited number of efficient Add-user operations and Remove-user operations. A scalable system achieves an unlimited number of revocations while retaining high level of efficiency by dividing the run-time of the system into periods. Each period has a saturation level for the number of revocations. When a period becomes saturated, an efficient new-period operation is issued by the system server that resets the saturation level. We present a formal adversarial model for our system taking into account its periodic structure, and we prove our construction secure, both against adversaries that attempt to cheat the revocation mechanism as well as against adversaries that attempt to cheat the traitor tracing mechanism.
Starting Page	190
Ending Page	199
Page Count	10
File Format	PDF
ISBN	1581137087
DOI	10.1145/872035.872062
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-07-13
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Multicast Scalability Digital content distribution Traitor tracing Broadcast encryption
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