Efficient Rebalancing of Chromatic Search TreesOn the concrete complexity of zero-knowledge proofsPractical zero-knowledge proofs: Giving hints and using deficienciesShort non-interactive cryptographic proofs