default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristiyan Haralambiev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j2]Masayuki Abe, Georg Fuchsbauer, Jens Groth
, Kristiyan Haralambiev, Miyako Ohkubo:
Structure-Preserving Signatures and Commitments to Group Elements. J. Cryptol. 29(2): 363-421 (2016)- 2015
- [c14]Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev, Markulf Kohlweiss:
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions. ASIACRYPT (2) 2015: 262-288 - [i8]Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev, Markulf Kohlweiss:
Composable & Modular Anonymous Credentials: Definitions and Practical Constructions. IACR Cryptol. ePrint Arch. 2015: 580 (2015) - 2013
- [j1]Masayuki Abe, Sherman S. M. Chow, Kristiyan Haralambiev, Miyako Ohkubo:
Double-trapdoor anonymous tags for traceable signatures. Int. J. Inf. Sec. 12(1): 19-31 (2013) - [c13]Christian Cachin, Kristiyan Haralambiev, Hsu-Chun Hsiao, Alessandro Sorniotti:
Policy-based secure deletion. CCS 2013: 259-270 - [i7]Christian Cachin, Kristiyan Haralambiev, Hsu-Chun Hsiao, Alessandro Sorniotti:
Policy-based Secure Deletion. IACR Cryptol. ePrint Arch. 2013: 152 (2013) - 2012
- [c12]Masayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo:
Group to Group Commitments Do Not Shrink. EUROCRYPT 2012: 301-317 - [c11]Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev:
Efficient Structure-Preserving Signature Scheme from Standard Assumptions. SCN 2012: 76-94 - 2011
- [b1]Kristiyan Haralambiev:
Efficient Cryptographic Primitives for Non-Interactive Zero-Knowledge Proofs and Applications. New York University, USA, 2011 - [c10]Masayuki Abe, Sherman S. M. Chow, Kristiyan Haralambiev, Miyako Ohkubo:
Double-Trapdoor Anonymous Tags for Traceable Signatures. ACNS 2011: 183-200 - [c9]Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens:
Structure Preserving CCA Secure Encryption and Applications. ASIACRYPT 2011: 89-106 - [c8]Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo:
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. CRYPTO 2011: 649-666 - [c7]Sherman S. M. Chow, Kristiyan Haralambiev:
Non-interactive Confirmer Signatures. CT-RSA 2011: 49-64 - [i6]Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens:
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties. IACR Cryptol. ePrint Arch. 2011: 319 (2011) - [i5]Carl Bosley, Kristiyan Haralambiev, Antonio Nicolosi:
HBN: An HB-like protocol secure against man-in-the-middle attacks. IACR Cryptol. ePrint Arch. 2011: 350 (2011) - 2010
- [c6]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Efficient Public-Key Cryptography in the Presence of Key Leakage. ASIACRYPT 2010: 613-631 - [c5]Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo:
Structure-Preserving Signatures and Commitments to Group Elements. CRYPTO 2010: 209-236 - [c4]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Cryptography against Continuous Memory Attacks. FOCS 2010: 511-520 - [c3]Masayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo:
Efficient Message Space Extension for Automorphic Signatures. ISC 2010: 319-330 - [c2]Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup:
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model. Public Key Cryptography 2010: 1-18 - [i4]Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup:
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model. IACR Cryptol. ePrint Arch. 2010: 33 (2010) - [i3]Masayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo:
Signing on Elements in Bilinear Groups for Modular Protocol Design. IACR Cryptol. ePrint Arch. 2010: 133 (2010) - [i2]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Efficient Public-Key Cryptography in the Presence of Key Leakage. IACR Cryptol. ePrint Arch. 2010: 154 (2010) - [i1]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Cryptography Against Continuous Memory Attacks. IACR Cryptol. ePrint Arch. 2010: 196 (2010)
2000 – 2009
- 2004
- [c1]Louise Guthrie, Roberto Basili, Fabio Massimo Zanzotto, Kalina Bontcheva, Hamish Cunningham, David Guthrie, Jia Cui, Marco Cammisa, Jerry Cheng-Chieh Liu, Cassia Farria Martin, Kristiyan Haralambiev, Martin Holub, Klaus Macherey, Frederick Jelinek:
Large Scale Experiments for Semantic Labeling of Noun Phrases in Raw Text. LREC 2004
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-25 05:45 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:
