summaryrefslogtreecommitdiffhomepage
path: root/Shard.hs
blob: a6043fdfa2044be3d21c1e2c4f33226f9dd1b5ab (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
{-# LANGUAGE OverloadedStrings, MultiParamTypeClasses #-}

module Shard where

import Types
import Tunables
import ExpensiveHash
import Cost
import qualified Crypto.SecretSharing as SS
import qualified Data.ByteString as B
import qualified Data.ByteString.Lazy as BL
import qualified Raaz.Core.Encode as Raaz
import qualified Raaz.Hash.Sha256 as Raaz
import qualified Data.Text as T
import qualified Data.Text.Encoding as E
import Data.Binary
import Data.Monoid

data ShardIdents = ShardIdents
	{ getIdents :: [StorableObjectIdent]
	, identsCreationCost :: Cost CreationOp
	, identsBruteForceCalc :: CostCalc BruteForceOp UnknownName
	}

instance Bruteforceable ShardIdents UnknownName where
	getBruteCostCalc = identsBruteForceCalc

-- | Generates identifiers to use for storing shards.
--
-- This is an expensive operation, to make it difficult for an attacker
-- to brute force known/guessed names and find matching shards.
-- The keyid is used as a salt, both to avoid collisions when the same
-- name is chosen for multiple keys, and to prevent the attacker
-- from using a rainbow table from names to expensivehashes.
shardIdents :: Tunables -> Name -> KeyId -> ShardIdents
shardIdents tunables (Name name) keyid =
	ShardIdents idents creationcost bruteforcecalc
  where
	(ExpensiveHash creationcost basename) =
		expensiveHash tunables (Salt keyid) name
	mk n = StorableObjectIdent $ Raaz.toByteString $ mksha $
		E.encodeUtf8 $ basename <> T.pack (show n)
	mksha :: B.ByteString -> Raaz.Base16
	mksha = Raaz.encode . Raaz.sha256
	idents = map mk [1..totalObjects (head (shardParams tunables))]
	bruteforcecalc = bruteForceLinearSearch creationcost

genShards :: EncryptedSecretKey -> Tunables -> IO [StorableObject]
genShards (EncryptedSecretKey esk _) tunables = 
	map (StorableObject . encode) <$> SS.encode
		(neededObjects $ head $ shardParams tunables)
		(totalObjects $ head $ shardParams tunables)
		(BL.fromStrict esk)

--  Throws AssertionFailed if the number of shares is too small.
combineShards :: [StorableObject] -> EncryptedSecretKey
combineShards = mk . BL.toStrict . SS.decode . map conv
  where
	conv = decode . fromStorableObject
	mk b = EncryptedSecretKey b unknownCostCalc