On the bit security of cryptographic primitives
type: Item
instance of: scholarly article
title: On the bit security of cryptographic primitives
zbMATH Open document ID: 1423.94090
DOI: 10.1007/978-3-319-78381-9_1
author: Daniele Micciancio
author: Michael Walter
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900671
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 1
OpenAlex ID: W2795300525
cites work: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
cites work: Q3149676
cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
cites work: Non-uniform Cracks in the Concrete: The Power of Free Precomputation
cites work: Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
cites work: Message Authentication Codes from Unpredictable Block Ciphers
cites work: Foundations of Cryptography
cites work: Probabilistic encryption
cites work: A Pseudorandom Generator from any One-way Function
cites work: Gaussian sampling over the integers: efficient, generic, constant-time
cites work: Enhanced Lattice-Based Signatures on Reconfigurable Hardware
cites work: Sharper bounds in lattice-based cryptography using the Rényi divergence
cites work: The Bitcoin backbone protocol with chains of variable difficulty
cites work: The Bitcoin Backbone Protocol: Analysis and Applications
cites work: A characterization of eventual Byzantine agreement
cites work: Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
cites work: Early Detection of Message Forwarding Faults
cites work: On expected constant-round protocols for Byzantine agreement
cites work: Ouroboros: a provably secure proof-of-stake blockchain protocol
cites work: Fast Paxos
cites work: No double discount: condition-based simultaneity yields limited gain
cites work: Analysis of the Blockchain Protocol in Asynchronous Networks
cites work: Thunderella: blockchains with optimistic instant confirmation
cites work: FruitChains
cites work: The sleepy model of consensus
cites work: Bosco: One-Step Byzantine Asynchronous Consensus
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
cites work: How to use indistinguishability obfuscation
cites work: How to Obfuscate Programs Directly
Recommended article: On the bit security of the Diffie-Hellman key
Recommended article: Q2708626
Recommended article: On the design of cryptographic primitives
Recommended article: On the bit security of the weak Diffie-Hellman problem
Recommended article: Q4536814
Recommended article: On the Bit Security of Elliptic Curve Diffie–Hellman
Recommended article: On the Circular Security of Bit-Encryption
Recommended article: On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
description: scientific article; zbMATH DE number 6900671