Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model

Mihir Bellare Y, Viet Tung Hoang

Published Jan 1, 2015• 65 citations
Publisher
DOI
10.1007/978-3-662-46803-6_21

Related papers

Hedged Public-Key Encryption: How to Protect against Bad Randomness

Mihir Bellare Y, Zvika Brakerski, Moni Naor +4 more

Lecture notes in computer science•Jan 1, 2009•133 citations

Updatable Public Key Encryption in the Standard Model

Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs

Lecture notes in computer science•Jan 1, 2021•27 citations

Public key encryption with equality test in the standard model

Hyung Tae Lee, San Ling, Jae Hong Seo +2 more

Information Sciences•Dec 16, 2019•80 citations

Lattice-based certificateless public-key encryption in the standard model

Reza Sepahi, Ron Steinfeld, Josef Pieprzyk

International Journal of Information Security•Dec 9, 2013•13 citations

UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model.

Mihir Bellare Y, Viet Tung Hoang

This paper provides the first efficient, standard-model, fully-secure schemes for some related and challenging forms of public-key encryption (PKE), namely deterministic and hedged PKE. These forms of PKE defend against subversion of random number generators, an end given new urgency by recent revelations on the nature and extent of such subversion. We resolve the (recognized) technical chal-lenges in reaching these goals via a new paradigm that combines UCEs (universal computational extractors) with LTDFs (lossy trapdoor functions). Crucially, we rely only on a weak form of UCE, namely security for statistically (rather than computationally) unpredictable sources. We then de-fine and achieve unique-ciphertext PKE as a way to defend against implementation subversion via

•Jan 1, 2014•2 citations

Public-Randomness in Public-Key Cryptography

Alfredo De Santis, Giuseppe Persiano

Lecture notes in computer science•Jan 1, 1991•16 citations
This paper provides the first efficient, standard-model, fully-secure schemes for some related and challenging forms of public-key encryption (PKE), namely deterministic and hedged PKE. These forms of PKE defend against subversion of random number generators, an end given new urgency by recent revelations on the nature and extent of such subversion. We resolve the (recognized) technical chal-lenges in reaching these goals via a new paradigm that combines UCEs (universal computational extractors) with LTDFs (lossy trapdoor functions). Crucially, we rely only on a weak form of UCE, namely security for statistically (rather than computationally) unpredictable sources. We then de-fine and achieve unique-ciphertext PKE as a way to defend against implementation subversion via