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