libbrandt.git - libbrandt

	Commit message (Collapse)	Author	Age
*	git ignore bench binaryHEAD master	Markus Teich	2017-02-14
\|
*	fix msg header documentation	Markus Teich	2017-02-14
\|
*	add benchmarking tool	Markus Teich	2017-02-14
\|
*	modify fp_priv gp script for eval (old)	Markus Teich	2017-02-14
\|
*	whitespace	Markus Teich	2017-01-04
\|
*	gp-scripts: add zkp + test parameters	Markus Teich	2017-01-04
\|
*	move ecdlogctx passing to _join()/_new() functions	Markus Teich	2016-12-02
\|
*	add error log msg	Markus Teich	2016-12-02
\|
*	fix	Markus Teich	2016-12-02
\|
*	abort instead of assert	Markus Teich	2016-12-02
\|
*	make byte plural consistent	Markus Teich	2016-12-02
\|
*	fix doc in brandt.h	Markus Teich	2016-12-02
\|
*	unify msg delivery callback	Markus Teich	2016-12-02
\|
*	style	Markus Teich	2016-12-02
\|
*	cleanup todos in brandt.h	Markus Teich	2016-12-02
\|
*	use new GNUNET_assert_from()	Markus Teich	2016-12-02
\|
*	migrate to GNUNET_assert	Markus Teich	2016-12-02
\|
*	migrate to GNUNET_log	Markus Teich	2016-12-02
\|
*	use GNUNET_log in test_brandt	Markus Teich	2016-11-29
\|
*	coding style	Markus Teich	2016-11-29
\|
*	doc two missing parameters	Markus Teich	2016-11-23
\|
*	remove unnecessary description handling and hashing.	Markus Teich	2016-11-23
\| \| \| \| \| \| \|	The hash is not needed since the sellers application is required to sign the description and the bidders application is required to check the signature. Since the arbitrary description used by the application was only used inside this hash, it can be removed as well.
*	add doc for test-case function	Markus Teich	2016-11-23
\|
*	fix memleak	Markus Teich	2016-11-23
\|
*	add m+1st price auctions with public outcome	Markus Teich	2016-11-22
\|
*	abort() on OOM	Markus Teich	2016-11-22
\|
*	BRANDT_new() returns NULL on parameter failure	Markus Teich	2016-11-22
\|
*	clarify BRANDT_new doc	Markus Teich	2016-11-04
\|
*	clarify BRANDT_CbStart doc	Markus Teich	2016-11-04
\|
*	handle n <= m case in m+1st price auctions	Markus Teich	2016-11-01
\| \| \| \| \| \|	The lowest possible price from the price map will be the price each bidder has to pay. Since the seller can define the price map, he can set the lowest price to the lowest he is willing to sell one item at.
*	add todo entry	Markus Teich	2016-11-01
\|
*	test for no bidders	Markus Teich	2016-11-01
\|
*	fix alignment	Markus Teich	2016-10-31
\|
*	remove debug output	Markus Teich	2016-10-15
\|
*	add M+1st price private outcome implementation	Markus Teich	2016-10-15
\|
*	math.tex: fix M+1st private outcome function	Markus Teich	2016-10-15
\|
*	fixup test_brandt	Markus Teich	2016-10-15
\|
*	fix preparation for M+1st price auctions	Markus Teich	2016-10-14
\|
*	make test_brandt ready for M+1st price auctions	Markus Teich	2016-10-14
\|
*	rework test_brandt	Markus Teich	2016-10-14
\|
*	clarify docstring	Markus Teich	2016-10-13
\|
*	blow up k on M+1st price auctions	Markus Teich	2016-10-13
\|
*	remove test.h dependency from test_brandt.c	Markus Teich	2016-10-13
\|
*	simplify encrypt_bid	Markus Teich	2016-10-12
\|
*	typo	Markus Teich	2016-10-12
\|
*	math.tex: add first price public outcome protocol and description for M+1st ↵	Markus Teich	2016-10-12
\| \| \| \|	price private outcome protocol
*	simplify check	Markus Teich	2016-10-12
\|
*	math.tex: fix M+1st price outcome determination formula	Markus Teich	2016-10-09
\|
*	math.tex: fix index for additional ZKP on M+1st price auctions	Markus Teich	2016-10-09
\|
*	add additional proof on encrypt_bid for M+1st price auctions	Markus Teich	2016-10-09
\| \| \| \| \| \|	This is needed to ensure bidders are only chosing bids from the subset which is allowed to them. This prevents ties and keeps the protocol way more simple for M+1st price auctions.