The following pages link to Aggelos Kiayias (Q357116):
Displayed 50 items.
- Encryption for digital content (Q357118) (← links)
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- Non-malleable codes for partial functions with manipulation detection (Q776000) (← links)
- SoK: a consensus taxonomy in the blockchain era (Q785022) (← links)
- Consensus from signatures of work (Q785024) (← links)
- Secure outsourcing of cryptographic circuits manufacturing (Q1616639) (← links)
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain (Q1648822) (← links)
- The Bitcoin backbone protocol with chains of variable difficulty (Q1675729) (← links)
- Ouroboros: a provably secure proof-of-stake blockchain protocol (Q1675731) (← links)
- A universally composable framework for the privacy of email ecosystems (Q1710670) (← links)
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup (Q1753862) (← links)
- On the security properties of e-voting bulletin boards (Q1796816) (← links)
- Graded signatures (Q1799239) (← links)
- Distributed parameter generation for bilinear Diffie Hellman exponentiation and applications (Q1799267) (← links)
- Blockchains from non-idealized hash functions (Q2055724) (← links)
- Ledger combiners for fast settlement (Q2055725) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Account management in proof of stake ledgers (Q2106625) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Efficient state management in distributed ledgers (Q2147249) (← links)
- Fast isomorphic state channels (Q2147250) (← links)
- Multi-instance publicly verifiable time-lock puzzle and its applications (Q2147261) (← links)
- Proof-of-burn (Q2226613) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- The combinatorics of hidden diversity (Q2297852) (← links)
- On trees, chains and fast transactions in the blockchain (Q2303115) (← links)
- Decoding interleaved Reed-Solomon codes over noisy channels (Q2373723) (← links)
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
- A one-time stegosystem and applications to efficient covert communication (Q2442646) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- Tamper Resilient Circuits: The Adversary at the Gates (Q2867151) (← links)
- Efficient Proofs of Secure Erasure (Q2922679) (← links)
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model (Q2936611) (← links)
- Distributing the setup in universally composable multi-party computation (Q2943608) (← links)
- The Bitcoin Backbone Protocol: Analysis and Applications (Q2948386) (← links)
- End-to-End Verifiable Elections in the Standard Model (Q2948393) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
- (Q3001125) (← links)
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems (Q3005592) (← links)
- (Q3043933) (← links)
- Breaking and Repairing Asymmetric Public-Key Traitor Tracing (Q3082981) (← links)
- BiTR: Built-in Tamper Resilience (Q3102219) (← links)
- Compact Storage of Superblocks for NIPoPoW Applications (Q3294784) (← links)
- Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination (Q3524148) (← links)
- Privacy Preserving Data Mining within Anonymous Credential Systems (Q3540036) (← links)