Publication:2743964
From MaRDI portal
zbMath0968.90527MaRDI QIDQ2743964
Mihir Bellare, Phillip Rogaway
Publication date: 18 September 2001
90C60: Abstract computational complexity for mathematical programming problems
90C20: Quadratic programming
Related Items
Pseudorandom Functions: Three Decades Later, Unnamed Item, Tighter security proofs for GPV-IBE in the quantum random oracle model, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Identity based identification from algebraic coding theory, Sequential aggregate signatures with lazy verification from trapdoor permutations, Non-adaptive programmability of random oracle, A well-characterized approximation problem, Efficient discrete logarithm based multi-signature scheme in the plain public key model, A new framework for the design and analysis of identity-based identification schemes, A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model, Direct chosen-ciphertext secure identity-based key encapsulation without random oracles, Improving the exact security of digital signature schemes, Fiat-Shamir for highly sound protocols is instantiable, On the leakage-resilient key exchange, A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption, On complexity of unconstrained hyperbolic 0--1 programming problems, On approximation algorithms for concave mixed-integer quadratic programming, The complexity of approximating a nonlinear program, Immunization against complete subversion without random oracles, Tightly secure ring signatures in the standard model, Sound and complete computational interpretation of symbolic hashes in the standard model, On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
