A fake CryptoScheme used to test and debug P2-DPOP. More...

Inheritance diagram for frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme:

[legend]

Classes
class	FakePublicKeyShare
	A share of the (unused) public key. More...
class	FakeEncryptedInteger
	A wrapper around a BigInteger so that it implements AddableLimited. More...

Public Member Functions
	FakeCryptoScheme (Element params)
	Constructor.
String	toString ()
AddableInteger	decrypt (FakeEncryptedInteger initialCypherText, FakeEncryptedInteger partialDecryption)
FakeEncryptedInteger	encrypt (AddableInteger cleartext)
FakeEncryptedInteger	encrypt (AddableInteger cleartext, AddableInteger bound)
FakeEncryptedInteger	partialDecrypt (FakeEncryptedInteger cyphertext)
	Partially decrypts the input cyphertext.
FakeEncryptedInteger	reencrypt (FakeEncryptedInteger cyphertext)
FakeEncryptedInteger	partialDecrypt (FakeEncryptedInteger initialCypherText, FakeEncryptedInteger partialDecryption)
void	addPublicKeyShare (FakePublicKeyShare share)
FakePublicKeyShare	newPublicKeyShare ()
Public Member Functions inherited from frodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >
void	addPublicKeyShare (K share)
	Records another share of the public key.
E	encrypt (C cleartext)
	Encrypts a cleartext.
E	encrypt (C cleartext, C bound)
	Encrypts a cleartext.
E	reencrypt (E cyphertext)
	Re-encrypts a cyphertext.
E	partialDecrypt (E initialCypherText, E partialDecryption)
	Partially decrypts a cyphertext.
C	decrypt (E initialCypherText, E partialDecryption)
	Decrypts a cyphertext.

Static Public Member Functions
static synchronized void	resetCounter ()
	Resets the counter.

Private Attributes
final FakeEncryptedInteger	key
	Key used for FakeCryptoScheme.

Static Private Attributes
static final long	serialVersionUID = 5205003208535233191L
	Used for serialization.
static final FakeEncryptedInteger	TEN = new FakeEncryptedInteger("10")
	CONSTANT 10.
static FakeEncryptedInteger	cleartextPlusInf = new FakeEncryptedInteger("100000000000000000")
	+INF is replaced with this very large number, so that we can track its successive encryptions/decryptions
static final Object	lock = new Object ()
	Lock to call before creating new key.
static final String	startCounter = "10000"
	Initial value of the counter.
static FakeEncryptedInteger	counter = new FakeEncryptedInteger(startCounter)
	counter

Detailed Description

A fake CryptoScheme used to test and debug P2-DPOP.

Author: Eric Zbinden, Thomas Leaute

Constructor & Destructor Documentation

◆ FakeCryptoScheme()

frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeCryptoScheme ( Element params )

Constructor.

Parameters

params unused

References cleartextPlusInf, counter, key, lock, and TEN.

Member Function Documentation

◆ addPublicKeyShare()

void frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.addPublicKeyShare ( FakePublicKeyShare share )

See also: CryptoScheme.addPublicKeyShare(CryptoScheme.PublicKeyShare)

◆ decrypt()

AddableInteger frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.decrypt	(	FakeEncryptedInteger	initialCypherText,
		FakeEncryptedInteger	partialDecryption )

See also: CryptoScheme#decrypt(Serializable, Serializable)

Warning: this decryption cheats. It removes all encryption, including encryption from other keys

References frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.bigInt, cleartextPlusInf, frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.compareTo(), frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.mod(), frodo2.solutionSpaces.AddableInteger.PlusInfinity.PLUS_INF, and startCounter.

Referenced by frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest.decrypt().

Here is the call graph for this function:

◆ encrypt() [1/2]

FakeEncryptedInteger frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.encrypt ( AddableInteger cleartext )

See also: CryptoScheme#encrypt(Serializable)

References frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.add(), cleartextPlusInf, frodo2.solutionSpaces.AddableInteger.equals(), key, frodo2.solutionSpaces.AddableInteger.PlusInfinity.PLUS_INF, and frodo2.solutionSpaces.AddableInteger.toString().

Referenced by frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest.decrypt(), and encrypt().

Here is the call graph for this function:

◆ encrypt() [2/2]

FakeEncryptedInteger frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.encrypt	(	AddableInteger	cleartext,
		AddableInteger	bound )

See also: CryptoScheme#encrypt(Serializable, Serializable)

References encrypt().

Here is the call graph for this function:

◆ newPublicKeyShare()

FakePublicKeyShare frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.newPublicKeyShare ( )

See also: CryptoScheme.newPublicKeyShare()

Implements frodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >.

◆ partialDecrypt() [1/2]

FakeEncryptedInteger frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.partialDecrypt ( FakeEncryptedInteger cyphertext )

Partially decrypts the input cyphertext.

Parameters

cyphertext the cyphertext to be partially decrypted

Returns: the partially decrypted cyphertext

References frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.add(), key, frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.mod(), frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger.subtract(), and TEN.

Referenced by partialDecrypt().

Here is the call graph for this function:

◆ partialDecrypt() [2/2]

FakeEncryptedInteger frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.partialDecrypt	(	FakeEncryptedInteger	initialCypherText,
		FakeEncryptedInteger	partialDecryption )