The wonderful world of global random oracles
From MaRDI portal
Publication:1648798
DOI10.1007/978-3-319-78381-9_11zbMath1423.94057OpenAlexW2795109472MaRDI QIDQ1648798
Gregory Neven, Tommaso Gagliardoni, Jan Camenisch, Manu Drijvers, Anja Lehmann
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_11
Related Items (18)
Honest majority MPC with abort with minimal online communication ⋮ Witness-succinct universally-composable SNARKs ⋮ Efficient and universally composable single secret leader election from pairings ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ A random oracle for all of us ⋮ Algebraic adversaries in the universal composability framework ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Completeness theorems for adaptively secure broadcast ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Signatures from sequential-OR proofs ⋮ Blazing fast OT for three-round UC OT extension ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Abuse resistant law enforcement access systems ⋮ P2DEX: privacy-preserving decentralized cryptocurrency exchange
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-adaptive programmability of random oracle
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Secure integration of asymmetric and symmetric encryption schemes
- Non Observability in the Random Oracle Model
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Universal Composition with Responsive Environments
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- Random Oracles with(out) Programmability
- Consolidating Masking Schemes
- Threshold Implementations Against Side-Channel Attacks and Glitches
- Provably Secure Higher-Order Masking of AES
- Universally Composable Security with Global Setup
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A spectral characterization of correlation-immune combining functions
- Computationally Sound Proofs
- Detecting Flawed Masking Schemes with Leakage Detection Tests
- Analysis of Boolean Functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- Algorithmic Number Theory
This page was built for publication: The wonderful world of global random oracles
