First Page | Document Content | |
---|---|---|
Date: 2007-08-20 03:37:31Cryptography Secret sharing Public-key cryptography Proactive secret sharing Commitment scheme Ciphertext indistinguishability Adversary model Digital signature Encryption Information-theoretic security | The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗Add to Reading ListSource URL: web.cs.ucdavis.eduDownload Document from Source WebsiteFile Size: 294,27 KBShare Document on Facebook |
Information-Theoretic Security Analysis of Physical Uncloneable Functions c, S. Stallinga, A.H.M. Akkermans, W. Ophey P. Tuyls, B. Skori Philips Research Laboratories, Prof. Holstlaan 4,DocID: 1ujMY - View Document | |
Secure or Insure? A Game-Theoretic Analysis of Information Security Games Jens Grossklags Nicolas ChristinDocID: 1rBzP - View Document | |
Random Channel Hopping Schemes for Key Agreement in Wireless Networks Bin Zan Marco GruteserDocID: 1r3wb - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1qUxu - View Document | |
C:/Users/Bin/Documents/proposal/proposalTex/security/secretKeyNew/final_for_TVT/BinZanTVT.dviDocID: 1qGUn - View Document |