default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRazvan Rosie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Grigor Artem, Vincenzo Iovino, Razvan Rosie:
Multi-input Non-interactive Functional Encryption: Constructions and Applications. C2SI 2023: 158-177- [c9]Razvan Rosie:
A Minor Note on Obtaining Simpler iO Constructions via Depleted Obfuscators. CANS 2023: 563-587 - 2022
- [c8]Razvan Rosie:
Adaptively Secure Laconic Function Evaluation for NC1. CT-RSA 2022: 427-450 - 2021
- [c7]Samuel Jaques, Hart Montgomery, Razvan Rosie, Arnab Roy:
Time-Release Cryptography from Minimal Circuit Assumptions. INDOCRYPT 2021: 584-606 - [c6]Jim Barthel, Marc Beunardeau, Razvan Rosie, Rajeev Anand Sahu:
Partitioned Searchable Encryption. ProvSec 2021: 63-79 - [c5]Jim Barthel, Razvan Rosie:
NIKE from Affine Determinant Programs. ProvSec 2021: 98-115 - [c4]Jim Barthel, Volker Müller, Razvan Rosie:
On the (M)iNTRU Assumption in the Integer Case. ProvSec 2021: 190-211 - 2020
- [j2]Anastasiya Gorodilova
, Sergey Agievich, Claude Carlet, Xiang-dong Hou, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Luca Mariot, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Razvan Rosie, Natalia N. Tokareva:
The Fifth International Students' Olympiad in cryptography - NSUCRYPTO: Problems and their solutions. Cryptologia 44(3): 223-256 (2020)
2010 – 2019
- 2019
- [b1]Razvan Rosie:
On the achievability of white-box cryptography. (Sur la faisabilité de la cryptographie en boîte-blanche). PSL Research University, Paris, France, 2019 - [c3]Rémi Géraud, David Naccache, Razvan Rosie:
Robust Encryption, Extended. CT-RSA 2019: 149-168 - [i6]Anastasiya Gorodilova, Sergey Agievich, Claude Carlet, Xiang-dong Hou, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Luca Mariot, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Razvan Rosie, Natalia N. Tokareva:
The Fifth International Students' Olympiad in Cryptography - NSUCRYPTO: problems and their solutions. CoRR abs/1906.04480 (2019) - [i5]Rémi Géraud, David Naccache, Razvan Rosie:
Robust Encryption, Extended. IACR Cryptol. ePrint Arch. 2019: 238 (2019) - 2018
- [c2]Razvan Rosie:
Adaptive-Secure VRFs with Shorter Keys from Static Assumptions. CANS 2018: 440-459 - 2017
- [j1]Pooya Farshim, Claudio Orlandi, Razvan Rosie:
Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Trans. Symmetric Cryptol. 2017(1): 449-473 (2017) - [c1]Rémi Géraud, David Naccache, Razvan Rosie:
Twisting Lattice and Graph Techniques to Compress Transactional Ledgers. SecureComm 2017: 108-127 - [i4]Pooya Farshim, Claudio Orlandi, Razvan Rosie:
Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Cryptol. ePrint Arch. 2017: 288 (2017) - [i3]Razvan Rosie:
Adaptive-Secure VRFs with Shorter Keys from Static Assumptions. IACR Cryptol. ePrint Arch. 2017: 750 (2017) - [i2]Rémi Géraud, David Naccache, Razvan Rosie:
Twisting Lattice and Graph Techniques to Compress Transactional Ledgers. IACR Cryptol. ePrint Arch. 2017: 751 (2017) - 2015
- [i1]Razvan Rosie:
Randomness of Spritz via DieHarder testing. CoRR abs/1502.01763 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
