default search action
Philippe Camacho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Jeb Bearer, Benedikt Bünz, Philippe Camacho, Binyi Chen, Ellie Davidson, Ben Fisch, Brendon Fish, Gus Gutoski, Fernando Krell, Chengyu Lin, Dahlia Malkhi, Kartik Nayak, Keyao Shen, Alex Luoyuan Xiong, Nathan Yospe:
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange. IACR Cryptol. ePrint Arch. 2024: 1189 (2024) - 2023
- [c8]Sourav Das
, Philippe Camacho
Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold. CCS 2023: 356-370 - [c7]Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho:
VeriZexe: Decentralized Private Computation with Universal Setup. USENIX Security Symposium 2023: 4445-4462 - [i7]Sourav Das, Philippe Camacho, Zhuolun Xiang, Javier Nieto, Benedikt Bünz, Ling Ren:
Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold. IACR Cryptol. ePrint Arch. 2023: 598 (2023) - 2022
- [i6]Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho:
VERI-ZEXE: Decentralized Private Computation with Universal Setup. IACR Cryptol. ePrint Arch. 2022: 802 (2022)
2010 – 2019
- 2018
- [c6]Philippe Camacho
Asynchronous Provably-Secure Hidden Services. CT-RSA 2018: 179-197 - 2017
- [i5]Philippe Camacho, Fernando Krell:
Asynchronous provably-secure hidden services. IACR Cryptol. ePrint Arch. 2017: 888 (2017) - 2013
- [c5]Philippe Camacho:
Fair Exchange of Short Signatures without Trusted Third Party. CT-RSA 2013: 34-49 - 2012
- [j1]Philippe Camacho, Alejandro Hevia
Strong accumulators from collision-resistant hashing. Int. J. Inf. Sec. 11(5): 349-363 (2012) - [c4]Philippe Camacho, Alejandro Hevia
Short Transitive Signatures for Directed Trees. CT-RSA 2012: 35-50 - [i4]Philippe Camacho:
Fair Exchange of Short Signatures without Trusted Third Party. IACR Cryptol. ePrint Arch. 2012: 288 (2012) - 2011
- [i3]Philippe Camacho, Alejandro Hevia:
Short Transitive Signatures for Directed Trees. IACR Cryptol. ePrint Arch. 2011: 438 (2011) - [i2]Philippe Camacho:
Optimal Data Authentication from Directed Transitive Signatures. IACR Cryptol. ePrint Arch. 2011: 439 (2011) - 2010
- [c3]Philippe Camacho, Alejandro Hevia
On the Impossibility of Batch Update for Cryptographic Accumulators. LATINCRYPT 2010: 178-188
2000 – 2009
- 2009
- [i1]Philippe Camacho:
On the Impossibility of Batch Update for Cryptographic Accumulators. IACR Cryptol. ePrint Arch. 2009: 612 (2009) - 2008
- [c2]Philippe Camacho, Alejandro Hevia
Strong Accumulators from Collision-Resistant Hashing. ISC 2008: 471-486 - 2004
- [c1]Mathieu Autonès, Ariel Beck, Philippe Camacho, Nicolas Lassabe, Hervé Luga, François Scharffe:
Evaluation of Chess Position by Modular Neural Network Generated by Genetic Algorithm. EuroGP 2004: 1-10
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-08-06 22:02 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: