On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Authors:
- 15 April 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 301-324
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Randomness-efficient oblivious sampling2002
- The Security of Chaffing and Winnowing2000
- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search2000
- Exposure-Resilient Functions and All-or-Nothing Transforms2000
- On the Security Properties of OAEP as an All-or-Nothing TransformLecture Notes in Computer Science, 1999
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming BoundsSIAM Journal on Discrete Mathematics, 1996
- High-bandwidth encryption with low-bandwidth smartcards1996
- Efficient sharing of many secrets1993
- On the bit extraction problem1992
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988