Presentation is loading. Please wait.

Presentation is loading. Please wait.

Access Control and Rights Management. Legal and Technical Issues Legal: When is a resource available to digitize and make available. What requirements.

Similar presentations

Presentation on theme: "Access Control and Rights Management. Legal and Technical Issues Legal: When is a resource available to digitize and make available. What requirements."— Presentation transcript:

1 Access Control and Rights Management

2 Legal and Technical Issues Legal: When is a resource available to digitize and make available. What requirements exist for controlling access. Technical: How do we control access to a resource that is stored online? –Policies –Encoding –Distribution limitations

3 Date of workProtected fromTerm Created 1-1-78 or after When work is fixed in tangible medium of expression Life + 70 years1(or if work of corporate authorship, the shorter of 95 years from publication, or 120 years from creation Published before 1923 In public domainNone Published 1923 - 63 When published with notice328 years + could be renewed for 47 years, now extended by 20 years for a total renewal of 67 years. If not so renewed, now in public domain Published from 1964 - 77 When published with notice28 years for first term; now automatic extension of 67 years for second term Created before 1- 1-78 but not published 1-1-78, the effective date of the 1976 Act which eliminated common law copyright Life + 70 years or 12-31-2002, whichever is greater Created before 1-1-78 but published between then and 12-31-2002 1-1-78, the effective date of the 1976 Act which eliminated common law copyright Life + 70 years or 12-31-2047 whichever is greater Chart created by Lolly Gasaway. Updates at

4 Works for hire Usual case -- works created by faculty are not the property of the university. –Faculty surrender copyright to publishers of journals and books –Some publishers allow faculty to retain copyright, giving the publisher specific limited rights to reproduce and distribute the work.

5 Fair use No clear, easy answers. Checksheet provided in the article is a good guide to the issues. Link to the checksheet:

6 Moral rights Fair to the creator –Keep the identity of the creator of the work –Do not cut the work –Generally, be considerate of the person (or institution) that created the work.

7 Getting Permission With the best will in the world, getting the appropriate permissions is not always easy. –Identify who holds the rights –Get in touch with the rights holder –Get a suitable agreement to cover the needs of your use. Useful links: –Connections to various ways to discover and contact the rights holder of a work.

8 Source: NINCH Guide to Good Practice. Chapter 4: Rights Management Checking copyright status

9 Source: NINCH Guide to Good Practice. Chapter 4: Rights Management Copyright: Lauryn G. Grant Considering people depicted in the work

10 Technical issues Link the resource to the copyright statements Maintain that link when the resource is copied or used Approaches: –Steganography –Encryption –Digital Wrappers –Digital Watermarks

11 Issues in Encryption General cases for protection of controlled content: Concern for passive listening, active interference. –Listening: intruder gains information, may not be detected. Effects indirect. –Active interference Intruder may prevent delivery of the message to the intended recipient. Intruder may substitute a fake message for the intended one Effects are direct and immediate Less likely in the case of digital library content

12 Message interception Original message Encoding Method Ciphertext Decoding Method Received message EavesdroppingMasquerading Intruder (Plain text)

13 Types of Encryption Methods Substitution –Simple adjustment, Caesar’s cipher Each letter is replaced by one that is a fixed distance from it in the alphabet. A becomes D, B becomes E, etc. At the end, wrap around, so X becomes A, Y becomes B, Z becomes C. May have been confusing the fist time it was done, but it would not have taken long to figure it out. –Simple substitution of other characters for letters -- numbers, dancing men, etc. –More complex substitution. No pattern to the replacement scheme. See common cryptogram puzzles. These are usually made easier by showing the spaces between the words. (For very modern version, see )

14 Dancing Men???? Arthur Conan Doyle: The Adventure of the Dancing Men. A Sherlock Holmes Adventure. Read the story online and see the images and analysis of the decoding at “Speaking roughly, T, A, O, I, N, S, H, R, D, and L are the numerical order in which letters occur; but T, A, O, and I are very nearly abreast of each other, and it would be an endless task to try each combination until a meaning was arrived at.”

15 Types of encryption - 2 Hiding the text. The wax tablet example –message written on the base of the tablet and wax put over top of it with another message on the wax Steganography: (ste-g&n-o´gr&-fē) (n.) The art and science of hiding information by embedding messages within other, seemingly harmless messages. Steganography works by replacing bits of useless or unused data in regular computer files (such as graphics, sound, text, HTML, or even floppy disks ) with bits of different, invisible information. This hidden information can be plain text, cipher text, or even images. Special software is needed for steganography, and there are freeware versions available at any good download site. Can be used to insert identification into a file to track its source. Definition from

16 Types of encryption - 3 Key-based shuffling –Using a mnemonic to make the key easy to remember. A machine to do the shuffling A D B C D C B A What shuffling is used? How would “CAB” look?

17 Monoalphabetic codes Any kind of substitution in which just one letter (or other symbol) represents one letter from the original alphabet is called monoalphabetic encoding. –Such codes are easy to break. That is what you do when you solve cryptograms. –Frequency distribution of letters in normal text for a given language are well known. “The twelve most frequently-used letters in the English language are ETAOIN SHRDL, in that order.” --

18 Letter distributions in English A7.81%N7.28%TH3.18OU0.72THE6.42 B1.28O8.21IN1.54IT0.71OF4.02 C2.93P2.15ER1.3ES0.69AND3.15 D4.11Q0.14RE1.30ST0.68TO2.36 E13.05R6.64AN1.08OR0.68A2.09 F2.88S6.46HE1.08NT0.67IN1.77 G1.39T9.02AR102HI0.68THAT1.25 H5.85U2.77EN1.02EA0.64IS1.03 I6.77V1.00TI1.02VE0.64I0.94 J0.23W1.49TE0.98CO0.59IT0.93 K0.42X0.30AT0.88DE0.55FOR0.77 L3.60Y1.51ON0.84RA0.55AS0.76 M2.62Z0.09HA0.84RO0.55WITH0.76 SOURCE: Tannenbaum Computer Networks 1981 Prentice Hall

19 Disguising frequencies First trick: use more than 26 symbols and use several different symbols to represent the same letter. The goal is to even out the distribution. Ex. Use the letters plus the digits. –36 symbols –Assign five symbols to the letter E, two to the letter I, three to the letter N, two each to R and S.

20 More complex Vigenere’s table Arrange all the letters of the alphabet 26 times, in parallel columns, such that each column begins with a different letter, first A, then B, etc. Encode each letter by using a different column for each successive letter of the message. How to know which column to use? Use a keyword. Examples and breaking:

21 Decoding The Vigenere cipher looks really hard, but is not secure. Since the keyword repeats, it is really just a bunch of monoalphabetic codes. If you can figure out the length of the keyword, you can do standard analysis. Making it harder - instead of a regular arrangement of the letter columns, scramble them in some arbitrary way. –Makes decoding much more difficult, but also makes it difficult to have the arrangement known to the people who are supposed to be able to read the message.

22 Enigma Suppose we take a conversion for the first letter of the message and a different mapping for the next letter and a different mapping for the next letter … That is what we did with Vigenere Add additional encodings. Rotate from a fixed starting point through 26 positions of the first set of columns, then iterate a second set of columns. Now have 676 different mappings. To decode, must figure out the wiring inside each phase, and the order in which they are arranged in the machine.

23 Enigma German engineer, Artur Scherbius (1878- 1929) invented a machine of this type around 1918 and bought the patent rights to one invented in Holland also. He added a reflecting cylinder, which allowed the same machine to encode and decode. He called the machine enigma, from the Greek for riddle. The enigma used by the Germans in WWII had three rotors, and later four.

24 Enigma - 2

25 Encryption/Decryption Keys Problem is that you have to get the key to the receiver, secretly and accurately. If you can get the key there, why not use the same method to send the whole message? (Efficiency of scale) If the key is compromised without the communicators knowing it, the transmissions are open. Exact working of the enigma machine: – How Polish mathematicians broke the enigma –

26 Summary of encryption goals High level of data protection Simple to understand Complex enough to deter intruders Protection based on the key, not the algorithm Economical to implement Adaptable for various applications Available at reasonable cost

27 Data Encryption Standard Complex sequence of transformations –hardware implementations speed performance –modifications have made it very secure Known algorithm –security based on difficulty in discovering the key

28 The Data Encryption Standard Illustrated 64 bit blocks, 64 bit key Federal InformationProcessing Standards 46-2

29 INTERNET-LINKED COMPUTERS CHALLENGE DATA ENCRYPTION STANDARD LOVELAND, COLORADO (June 18, 1997). Tens of thousands of computers, all across the U.S. and Canada, linked together via the Internet in an unprecedented cooperative supercomputing effort to decrypt a message encoded with the government- endorsed Data Encryption Standard (DES). Responding to a challenge, including a prize of $10,000, offered by RSA Data Security, Inc, the DESCHALL effort successfully decoded RSADSI's secret message. According to Rocke Verser, a contract programmer and consultant who developed the specialized software in his spare time, "Tens of thousands of computers worked cooperatively on the challenge in what is believed to be one of the largest supercomputing efforts ever undertaken outside of government." Using a technique called "brute-force", computers participating in the challenge simply began trying every possible decryption key. There are over 72 quadrillion keys (72,057,594,037,927,936). At the time the winning key was reported to RSADSI, the DESCHALL effort had searched almost 25% of the total. At its peak over the recent weekend, the DESCHALL effort was testing 7 billion keys per second.

30 Public Key encryption Eliminates the need to deliver a key Two keys: one for encoding, one for decoding Known algorithm –security based on security of the decoding key Essential element: –knowing the encoding key will not reveal the decoding key

31 Effective Public Key Encryption Encoding method E and decoding method D are inverse functions on message M: –D(E(M)) = M Computational cost of E, D reasonable D cannot be determined from E, the algorithm, or any amount of plaintext attack with any computationally feasible techniqueplaintext attack E cannot be broken without D (only D will accomplish the decoding) Any method that meets these criteria is a valid Public Key Encryption technique

32 It all comes down to this: key used for decoding is dependent upon the key used for encoding, but the relationship cannot be determined in any feasible computation or observation of transmitted data

33 Rivest, Shamir, Adelman (RSA) Choose 2 large prime numbers, p and q, each more than 100 digits Compute n=p*q and z=(p-1)*(q-1) Choose d, relatively prime to zrelatively prime Find e, such that e*d=1 mod (z)e*d=1 mod (z) –or e*d mod z = 1, if you prefer. This produces e and d, the two keys that define the E and D methods.

34 Public Key encoding Convert M into a bit stringM into a bit string Break the bit string into blocks, P, of size k –k is the largest integer such that 2 k { "@context": "", "@type": "ImageObject", "contentUrl": "", "name": "Public Key encoding Convert M into a bit stringM into a bit string Break the bit string into blocks, P, of size k –k is the largest integer such that 2 k

35 An example: P=7; q=11; n=77; z=60 d=13; e=37; k=6 Test message = CAT Using A=1, etc and 5-bit representation : – 00011 00001 10100 Since k=6, regroup the bits (arrange right to left so that any padding needed will put 0's on the left and not change the value): –000000 110000 110100 (three leading zeros added to fill the block) decimal equivalent: 0 48 52 Each of those raised to the power 37 (e) mod n: 0 27 24 Each of those values raised to the power 13 (d) mod n (convert back to the original): 0 48 52

36 On a practical note: PGP You can create your own real public and private keys using PGP (Pretty Good Privacy) See the following Web site for full information. (MIT site - obsolete) eware/ eware/ Required_Files/PGP.html Required_Files/PGP.html

37 Issues Intruder vulnerability –If an intruder intercepts a request from A for B’s public key, the intruder can masquerade as B and receive messages from B intended for A. The intruder can send those same or different messages to B, pretending to be A. –Prevention requires authentication of the public key to be used. Computational expense –One approach is to use Public Key Encryption to send the Key for use in DES, then use the faster DES to transmit messages

38 Digital Signatures Some messages do not need to be encrypted, but they do need to be authenticated: reliably associated with the real sender –Protect an individual against unauthorized access to resources or misrepresentation of the individual’s intentions –Protect the receiver against repudiation of a commitment by the originator

39 Digital Signature basic technique Sender A Receiver B Intention to send E(Random Number) where E is A’s public key Message and D(E(Random Number))

40 Public key encryption with implied signature Add the requirement that E(D(M)) = M Sender A has encoding key E A, decoding key D A Intended receiver has encoding (public) key E B. A produces E B (D A (M)) Receiver calculates E A (D B (E B (D A (M)))) –Result is M, but also establishes that only A could have encoded M

41 Digital Signature Standard (DSS) Verifies that the message came from the specified source and also that the message has not been modified More complexity than simple encoding of a random number, but less than encrypting the entire message Message is not encoded. An authentication code is appended to it.

42 Digital Signature - SHA FIPS Pub 186 - Digital Signature Standard

43 Encryption summary Problems –intruders can obtain sensitive information –intruder can interfere with correct information exchange Solution –disguise messages so an intruder will not be able to obtain the contents or replace legitimate messages with others

44 Important methods DES –fast, reasonably good encryption –key distribution problem Public Key Encryption –more secure based on the difficulty of factoring very large numbers –no key distribution problem –computationally intense

45 Digital signatures Authenticate messages so the sender cannot repudiate the message later Protect messages from changes during transmission or at the receiver’s site Useful when the contents do not need encryption, but the contents must be accurate and correctly associated with the sender

46 Legal and ethical issues People who work in these fields face problems with allowable exports, and are not always allowed to talk about their work. Is it desirable to have government able to crack all codes? What is the tradeoff between privacy of law abiding citizens vs. the ability of terrorists and drug traffickers to communicate in secret?

Download ppt "Access Control and Rights Management. Legal and Technical Issues Legal: When is a resource available to digitize and make available. What requirements."

Similar presentations

Ads by Google