Unbreakable keys from random noise

Security with Noisy Data: On Private Biometrics, Secure Key Storage and Anti-Counterfeiting

Volumn , Issue , 2007, Pages 21-44

  Maurer, Ueli ^a   Renner, Renato ^a   Wolf, Stefan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77952412339     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84628-984-2_2     Document Type: Chapter

References (6)

1. It should be mentioned that also unconditionally security is based on an assumption, namely that our probabilistic model of Nature is (at least partially) correct.
2. All logarithms are to base 2.
3. The concept of simulators in cryptographic security definitions has been introduced in [135].
4. A→B denotes an authentic public channel for arbitrarily long messages.
5. A secure sketch as defined in [91] can be seen as a special case of an information reconciliation protocol where the sketching and the recovery procedure correspond to Alice's and Bob's programs, respectively.
6. A fuzzy extractors as defined in [91] can generally be seen as a one-way keyagreement protocol where the generation and the reproduction procedure correspond to Alice's and Bob's programs, respectively. The helper string generated by the generation procedure of a secure sketch corresponds to the message sent from Alice to Bob in a one-way key-agreement protocol.