


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2011
- Gilles Barthe, Federico Olmedo
, Santiago Zanella Béguelin:
Verifiable Security of Boneh-Franklin Identity-Based Encryption. ProvSec 2011: 68-83 - Gilbert Baumslag, Nelly Fazio, Antonio Nicolosi, Vladimir Shpilrain, William E. Skeith III:
Generalized Learning Problems and Applications to Non-commutative Cryptography. ProvSec 2011: 324-339 - Cheng Chen, Zhenfeng Zhang, Dengguo Feng:
Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost. ProvSec 2011: 84-101 - Rong Cheng, Bo Zhang, Fangguo Zhang
:
Secure Obfuscation of Encrypted Verifiable Encrypted Signatures. ProvSec 2011: 188-203 - Ning Ding, Dawu Gu:
Precise Time and Space Simulatable Zero-Knowledge. ProvSec 2011: 16-33 - Kristian Gjøsteen, George Petrides
, Asgeir Steine:
A Novel Framework for Protocol Analysis. ProvSec 2011: 340-347 - Vipul Goyal:
Secure Composition of Cryptographic Protocols. ProvSec 2011: 2 - Jens Groth:
Optimal Structure-Preserving Signatures. ProvSec 2011: 1 - Yoshikazu Hanatani, Hirofumi Muratani, Tomoko Yonemura:
Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption. ProvSec 2011: 138-153 - Hai Huang:
Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security. ProvSec 2011: 389-397 - Fagen Li, Fahad Bin Muhaya, Mingwu Zhang, Tsuyoshi Takagi:
Efficient Identity-Based Signcryption in the Standard Model. ProvSec 2011: 120-137 - Shengli Liu, Junzuo Lai, Robert H. Deng
:
General Construction of Chameleon All-But-One Trapdoor Functions. ProvSec 2011: 257-265 - Xianhui Lu, Bao Li, Qixiang Mei, Haixia Xu:
Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing. ProvSec 2011: 297-308 - Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model. ProvSec 2011: 281-296 - Hitoshi Namiki, Keisuke Tanaka, Kenji Yasunaga:
Randomness Leakage in the KEM/DEM Framework. ProvSec 2011: 309-323 - Paolo Palmieri
, Olivier Pereira:
Secure Two-Party Computation over a Z-Channel. ProvSec 2011: 3-15 - Jiaxin Pan
, Libin Wang:
TMQV: A Strongly eCK-Secure Diffie-Hellman Protocol without Gap Assumption. ProvSec 2011: 380-388 - Duong Hieu Phan
, Viet Cuong Trinh
:
Identity-Based Trace and Revoke Schemes. ProvSec 2011: 204-221 - Keisuke Tanaka, Akihiro Yamada, Kenji Yasunaga:
Weak Oblivious Transfer from Strong One-Way Functions. ProvSec 2011: 34-51 - Rafael Tonicelli
, Bernardo Machado David, Vinícius de Morais Alves:
Universally Composable Private Proximity Testing. ProvSec 2011: 222-239 - Fushan Wei, Chuangui Ma, Zhenfeng Zhang:
Gateway-Oriented Password-Authenticated Key Exchange Protocol with Stronger Security. ProvSec 2011: 366-379 - Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferrer
:
Fully Distributed Broadcast Encryption. ProvSec 2011: 102-119 - Kazuki Yoneyama, Yunlei Zhao:
Taxonomical Security Consideration of Authenticated Key Exchange Resilient to Intermediate Computation Leakage. ProvSec 2011: 348-365 - Tsz Hon Yuen
, Duncan S. Wong, Willy Susilo
, Qiong Huang:
Concurrent Signatures with Fully Negotiable Binding Control. ProvSec 2011: 170-187 - Bingsheng Zhang:
Simulatable Adaptive Oblivious Transfer with Statistical Receiver's Privacy. ProvSec 2011: 52-67 - Bingsheng Zhang:
Generic Constant-Round Oblivious Sorting Algorithm for MPC. ProvSec 2011: 240-256 - Mingwu Zhang, Takashi Nishide, Bo Yang, Tsuyoshi Takagi:
Anonymous Encryption with Partial-Order Subset Delegation Functionality. ProvSec 2011: 154-169 - Liting Zhang, Wenling Wu, Peng Wang
:
PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers. ProvSec 2011: 266-280 - Xavier Boyen, Xiaofeng Chen:
Provable Security - 5th International Conference, ProvSec 2011, Xi'an, China, October 16-18, 2011. Proceedings. Lecture Notes in Computer Science 6980, Springer 2011, ISBN 978-3-642-24315-8 [contents]
loading more results
failed to load more results, please try again later

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.
retrieved on 2025-03-06 02:58 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint