FiatShamirTree

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9. final def getClass(): Class[_]

   

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

11. val internalNodePrefix: Byte

    

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

13. val leafPrefix: Byte

    

14. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

17. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

18. def toBytes(tree: ProofTree, w: SigmaByteWriter): Unit

    

    Prover Step 7: Convert the tree to a byte array s for input to the Fiat-Shamir hash function.

    Prover Step 7: Convert the tree to a byte array s for input to the Fiat-Shamir hash function. The conversion should be such that the tree can be unambiguously parsed and restored given the array. For each non-leaf node, the string should contain its type (OR or AND). For each leaf node, the string should contain the Sigma-protocol statement being proven and the commitment. The string should not contain information on whether a node is marked "real" or "simulated", and should not contain challenges, responses and/or the real/simulated flag for any node.

    tree

    the tree to take commitments from

    w

    writer which is used for serialization HOTSPOT: don't beautify the code

19. def toBytes(tree: ProofTree): Array[Byte]

    

    Prover Step 7: Convert the tree to a byte array s for input to the Fiat-Shamir hash function.

    Prover Step 7: Convert the tree to a byte array s for input to the Fiat-Shamir hash function. See the other overload for details.

20. def toString(): String

    

    Definition Classes

    AnyRef → Any

21. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )