◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. Warinschi

1 paper hereh-index 405.4k citations131 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CR1

identity via Semantic Scholar / OpenAlex

most citedExplicit Randomness is not Necessary when Modeling Probabilistic Encryption

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CR2006★ 3 cited

Explicit Randomness is not Necessary when Modeling Probabilistic Encryption

Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi

Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such m…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.