2003 資訊安全協定

討論內容

  Topics Reference Materials
0 Overall Trends
  1. slide
  2. Diffie IEEE Proc88, The First Ten Years Of Public Key Cryptography
  3. Goldwasser, FOCS97, New Directions In Cryptography Twenty Some Years Later
  4. Goldreich 98 (Crypto97), The Foundations of Modern Cryptography
  5. Maurer, Informatics00, Cryptography 2000+-10
  6. Nguyen 03, New Trends in Cryptology
1 Bit Commitment
  1. slide
  2. Goldreich, Foundation of Cryptography Chapter 4
2 Oblivious Transfer
  1. slide
  2. Rabin, Harvard TR-81, How to Exchange Secrets by Oblivious Transfer
  3. Even, CACM85, A Randomized Protocol For Signing Contracts
  4. Bellare, Crypto89, Noninteractive Oblivious Transfer And Application
  5. Crepeau, Crypto87, Equivalence Between Two Flavors Of Oblivious Transfer
  6. Kilian, STOC 88, Founding Cryptography On Oblivious Transfer
  7. Naor, 00, Computationally Secure Oblivious Transfer
  8. Noar, 00, Distributed Oblivious Transfer
  9. Garay, FOCS00, Concurrent Oblivious Transfer
3 Zero Knowledge Proof / Argument
  1. slide1, slide2
  2. Fiege, STOC87, Zero Knowledge Proof Of Identity
  3. Blum, STOC88, Non-Interactive Zero Knowledge And Its Applications
  4. Goldreich, 02, Zero Knowledge Twenty Years After Its Invention
  5. Quisquater, Crypto89, How To Explain Zero Knowledge Protocols To Your Children
  6. Goldreich, JACM91, Proofs That Yield Nothing But Their Validity or All Languages in NP Has ZKP Systems
  7. Noar, JC98, Perfect Zero-Knowledge Arguments For NP Using Any One-Way Permutation
  8. Goldreich, Foundation of Cryptography Chapter 4
  9. Cramer, Crypto94, Proofs Of Partial Knowledge And Simplified Design Of Witness Hiding Protocols
  10. Goldreich, SIAMJC96, On The Composition Of Zero Knowledge Proof Systems, slide
  11. Camenisch, Eurocrypt99, Proving In Zero Knowledge That A Number Is The Product Of Two Safe Primes
4 Two Party Computation
  1. slide
  2. Yao, FOCS82a, Protocols For Secure Computation
  3. Yao, FOCS86, How To Generate And Exchange Secrets
  4. Goldreich, STOC87, How To Play Any Mental Game
  5. Goldreich, Crypto87, How To Solve Any Protocol Problem An Efficiency Improvement
  6. Abadi, JC90, Secure Circuit Evaluation
  7. Galil, Crypto87, Cryptographic Computation Secure Fault Tolerant Protocols And The Public Key Model
  8. Chaum, Crypto87, Multiparty Computations Ensuring Privacy Of Each Partys Input And Correctness Of The Result
  9. Franklin, 92, An Overview Of Secure Distributed Computing
  10. Noar, EC99, Privacy Preserving Auctions And Mechanism Design
  11. Harnik, ECCC03, Completeness In Two-Party Secure Computation: A Computational View
5 How To Play Any Mental Game
  1. slide
  2. Goldreich, STOC87, How To Play Any Mental Game
6 Multiparty Computation
  1. slide
  2. Micali, Crypto91, Secure Computation
  3. Beaver, Crypto91, Foundations Of Secure Interactive Computing
  4. Franklin, 92, An Overview Of Secure Distributed Computing
  5. Franklin, 93 PHD UC(STOC92), Complexity And Security Of Distributed Protocols
  6. Goldreich, STOC87, How To Play Any Mental Game
  7. Goldreich 87 Protocol
  8. Galil, Crypto87, Cryptographic Computation Secure Fault Tolerant Protocols And The Public Key Model
  9. Chaum, Crypto87, Multiparty Computations Ensuring Privacy Of Each Partys Input And Correctness Of The Result
  10. Noar, EC99, Privacy Preserving Auctions And Mechanism Design
  11. Cramer, Eurocrypt01, Multiparty Computation From Threshold Homomorphic Encryption
  12. Canetti, 95 PHD, Studies In Secure Multiparty Computation And Applications
  13. Canetti, FOCS96, Incoercible Multiparty Computation
  14. Canetti, JC00, Security And Composition Of Multiparty Cryptographic Protocols
  15. Canetti, eprint02, Universally Composable Two Party And Multiparty Secure Computation
  16. Hirt, Asiacrypt00, Efficient Secure Multi-Party Computation
  17. Maurer, SCN02, Secure Multiparty Computation Made Simple
  18. Goldwasser, eprint02, Secure Computation Without A Broadcast Channel
  19. Goldreich, Foundation of Cryptography Chapter 7, note 1, note 2
  20. Jakobsson, Asiacrypt00, Mix and Match: Secure Function Evaluation via Ciphertexts
7 Multiparty Homomorphic Computation
  1. slide
  2. Jakobsson Asiacrypt 00, Addition Of ElGamal Plaintexts
  3. Cramer, Eurocrypt01, Multi-party Computation From Threshold Homomorphic Encryption
8 Byzantine Agreement
  1. slide,
  2. Lamport, PLS82, The Byzantine Generals Problem
  3. Fitzi, 02, Detectable Byzantine Agreement Secure Against Faulty Major
  4. Wagner, 02, Byzantine Agreements In Secure Communication,(slide)
  5. Xu, SRDS02, A Unified Proof Of Uniform Time Complexity For Reaching Consensus And Uniform Consensus A Oracle Based Approach
9 Noncryptographic Multiparty Computation
  1. slide
  2. Chaum, STOC88, Multiparty Unconditionally Secure Protocols
  3. Ben-Or, STOC88, Completeness Theorems For Non-Cryptographic Fault Tolerant Distributed Computation
10 Secret Sharing
  1. slide 1
  2. slide 2
  3. Shamir, CACM79, How To Share A Secret
  4. Blackley 79
  5. Stadler, Eurocrypt96, Publicly Verifiable Secret Sharing
  6. Berkovits, Eurocrypt91, How To Broadcast A Secret
  7. Desmedt, 97, Some Recent Research Aspects Of Threshold Cryptography
  8. Jarecki, 01, Efficient Threshold Cryptosystems
11 Secret Sharing Homomorphism
  1. slide
  2. Benaloh, Crypto86, Secret Sharing Homomorphisms Keeping Shares Of A Secret Secret
12 Private Information Retrieval
  1. slide
  2. Chor, FOCS95, Private Information Retrieval
  3. Chor, FOCS98, Private Information Retrieval
  4. Asonov, Informatik 01, Private Information Retrieval An Overview And Current Trends
13 Secret Exchange
  1. slide
  2. Blum, STOC83, How To Exchange Secret Keys
  3. Pedersen, Eurocrypt91, A Threshold Cryptosystem Without A Trusted Party, slide
  4. Boneh, Crypto97, Efficient Generation Of Shared RSA Keys
  5. Gennaro, Eurocrypt99, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
  6. Gennaro, ??, Revisiting The Distributed Key Generation For Discrete-Log Based Cryptosystems
14 SMC Problems and Applications
  1. slide
  2. Du, Purdue TR01, Secure MultiParty Computation Problems And Their Applications A Review And Open Problems
15 Privacy Preserving Auctions
  1. slide 1 (Second-Price Auction)
  2. slide 2 (Dynamic Programming)
  3. Noar, EC99, Privacy Preserving Auctions And Mechanism Design
  4. Omote, JAIST PHD 02, A Study On Electronic Auctions
  5. Yokoo, AAMAS02, Secure Multi-Agent Dynamic Programming Based On Homomorphic Encryption And Its Application To Combinatorial Auctions
  6. Brandt, CIA01, Cryptographic Protocols For Secure Second Price Auctions
  7. Suzuki, EC02, Secure Combinatorial Auctions By Dynamic Programming With Polynomial Secret Sharing
  8. Sandholm, AI02, Algorithm For Optimal Winner Determination In Combinatorial Auctions
  9. Abe, PKC02, (M+1)-st Price Auction Using Homomorphic Encryption
  10. Magkos, JECR03, Uncoerciable e-Bidding Games
16 Secure Vickrey Auctions
  1. slide
  2. Ausubel, 99, A Generalized Vickrey Auction
  3. Parkes, 02, An Ascending Price Generalized Vickrey Auction
  4. Parkes, AAAI00, Iterative Combinatorial Auctions Theory And Practice
  5. Papadimitriou, 2001 Lecture Note, Combinatorial Auctions
  6. Suzuki, FC03, Secure Generalized Vickrey Auction Using Homomorphic Encryption
17 Broadcast Encryption
  1. slide
  2. Berkovits, Eurocrypt91, How To Broadcast A Secret
  3. Halevy, Crypto02, The LSD Broadcast Encryption Scheme
18 Ring Signatures
  1. slide 1 (How to leak a secret and Threshold Ring Signatures)
  2. slide 2 (Deniable Ring Authentication)
  3. Rivest, Asiacrypt01, How To Leak A Secret
  4. Bresson, Crypto02, Threshold Ring Signatures For Ad Hoc Groups
  5. Naor, Crypto02, Deniable Ring Authentication
19 Fast Track SMC
  1. slide
  2. Gennaro, PODC98, Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography
20 Repetition Robustness
  1. slide
  2. Jakobsson, Eurocrypt98, A Practical Mix
21 Voting
  1. slide
  2. Baudron, PODC01, Practical Multi-Cadidate Election System, slide
  3. Rivest, FC01, Electronic Voting
  4. Rivest, Classnotes, 01, L03, Voting Requirements (slide), 02,L15, Voting and Homomorphic Encryption, 01, L10, Mixnets,
  5. Rjaskova, 02, Electronic Voting Schemes,
  6. Fujioka (FOO), Auscrypt92, A Practical Secret Voting Scheme,
  7. Abe, Asiacrypt99, Mix-Networks on Permutation Networks, pp. 317-324
22 Traitor Tracing
  1. slide
23 Deniable Encryption
  1. slide
  2. Canetti, Crypto97, Deniable Encryption
  3. Rjaskova, 02, Electronic Voting Schemes,
24 Formal Analysis
  1. slide
  2. Meadows, Formal Methods For Cryptographic Protocol Analysis Emerging Issues And Trends, slide1, slide2
  3. Dolev, IT83, On The Security Of Public Key Protocols
  4. Herzog, A Computational Interpretation Of Dolev Yao Adversaries
  5. Needham, CACM78, Using Encryption For Authentication In Large Network Of Computers, slide
25 Authentication
  1. Kim slide
26
  1. slide

資訊安全協定課程 首頁

製作日期: 09/25/2003 by 丁培毅 (Pei-yih Ting)
E-mail: pyting@cs.ntou.edu.tw TEL: 02 24622192x6615
海洋大學 工學院 資訊工程系 Lagoon