NIST Announcements
Computer Security Division
Crypto 2011 Rump Session

1 / 13

Draft NIST Special Publications
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Available for public comments■ Draft 800-38F: Recommendation for Block Cipher Modes ofOperation: Methods for Key Wrapping.
Close date: October 1, 20112 / 13

Draft NIST Special Publications
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Available for public comments■ Draft 800-38F: Recommendation for Block Cipher Modes ofOperation: Methods for Key Wrapping.
Close date: October 1, 2011
■ Draft 800-133: Recommendation for Cryptographic KeyGeneration
Close date: September 30, 20112 / 13

Draft NIST Special Publications
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

Available for public comments■ Draft 800-38F: Recommendation for Block Cipher Modes ofOperation: Methods for Key Wrapping.
Close date: October 1, 2011
■ Draft 800-133: Recommendation for Cryptographic Key

Generation
Close date: September 30, 2011
Find the links at http://csrc.nist.gov/publications/PubsDrafts.html

2 / 13

NIST Upcoming Workshop and Conference
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Workshop on Cryptography for Emerging Technologies and Applications
November 7-8, 2011
NIST Campus in Gaithersburg, MD, USA

3 / 13

NIST Upcoming Workshop and Conference
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

Workshop on Cryptography for Emerging Technologies and Applications
November 7-8, 2011
NIST Campus in Gaithersburg, MD, USA

The Third SHA-3 Candidate Conference
March 22-23, 2012
Washington DC, USA (co-located with FSE March 19-21)

3 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

A PUBLIC RANDOMNESS SOURCE.

4 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

THREAT MODEL.

5 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

Threat Model Rene.

6 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Threat Model Kelsey.

7 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

8 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Nixed!

9 / 13

NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications■ Will broadcast full-entropy bit-strings.

10 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications■ Will broadcast full-entropy bit-strings.
■ Will do it in blocks of 512 bits per minute.

10 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications■ Will broadcast full-entropy bit-strings.
■ Will do it in blocks of 512 bits per minute.
■ Will sign and time-stamp.

10 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications■ Will broadcast full-entropy bit-strings.
■ Will do it in blocks of 512 bits per minute.
■ Will sign and time-stamp.
■ Will link the sequence of blocks with a secure hash.

10 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications■ Will broadcast full-entropy bit-strings.
■ Will do it in blocks of 512 bits per minute.
■ Will sign and time-stamp.
■ Will link the sequence of blocks with a secure hash.
■ As for source of entropy, we are talking to NIST physicists.

10 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

Prototype architecture.

11 / 13NIST Beacon
Special Pubs.
Meetings
BeaconArchitectureTeamapplications

Team: Larry Basham, Michaela Iorga, Michael Fischer (Yale), John
Kelsey, Rene Peralta.

Timeframe: this year we plan to complete a prototype.

Contact: michaela.iorga@nist.gov

12 / 13

Applications
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

My favorite application: Given additively-homomorphic
bit-commitment, produce 4-tuples of bit-commitments guaranteed to
be in the set

U= {0111, 1011, 1101, 1110}

13 / 13

Applications
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

My favorite application: Given additively-homomorphic
bit-commitment, produce 4-tuples of bit-commitments guaranteed to
be in the set

U= {0111, 1011, 1101, 1110}(BDP 1996) : There is a linear transformation from U to correct
input-output bits of any binary linear gate.

13 / 13

Applications
Special Pubs.
Meetings
BeaconArchitecture
Teamapplications

My favorite application: Given additively-homomorphic
bit-commitment, produce 4-tuples of bit-commitments guaranteed tobe in the set

U= {0111, 1011, 1101, 1110}(BDP 1996) : There is a linear transformation from U to correct
input-output bits of any binary linear gate.
Use this until practical fully homomorphic encryption is available.

13 / 13