The following pages link to Ahto Buldas (Q1616879):
Displayed 25 items.
- Long-term secure time-stamping using preimage-aware hash functions (short version) (Q1616881) (← links)
- Simple infeasibility certificates for attack trees (Q1800831) (← links)
- Long-term secure commitments via extractable-binding commitments (Q2399947) (← links)
- (Q2718767) (← links)
- (Q2724617) (← links)
- Limiting Adversarial Budget in Quantitative Security Assessment (Q2818053) (← links)
- Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures (Q2948146) (← links)
- (Q3149756) (← links)
- New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees (Q3190044) (← links)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions? (Q3503876) (← links)
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions (Q3634498) (← links)
- Oracle Separation in the Non-uniform Model (Q3651594) (← links)
- (Q4249353) (← links)
- (Q4364777) (← links)
- (Q4440857) (← links)
- Upper Bounds for Adversaries’ Utility in Attack Trees (Q4909433) (← links)
- (Q4950052) (← links)
- Black-Box Separations and Their Adaptability to the Non-uniform Model (Q5300942) (← links)
- Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size (Q5300948) (← links)
- On Provably Secure Time-Stamping Schemes (Q5465834) (← links)
- Information Security (Q5493183) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- (Q5690053) (← links)
- Knowledge-Binding Commitments with Applications in Time-Stamping (Q5756530) (← links)
- Applied Cryptography and Network Security (Q5899208) (← links)