International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Privacy-Enhanced Participatory Sensing with Collusion Resistance and Data Aggregation
Eprint
https://eprint.iacr.org/2014/382
Felix Günther Mark Manulis Andreas Peter
Participatory sensing enables new paradigms and markets for information collection based on the ubiquitous availability of smartphones, but also introduces privacy challenges for participating users and their data. In this...
last revised 11 Sep 2014
Privacy-respecting Reward Generation and Accumulation for Participatory Sensing Applications
Eprint
https://eprint.iacr.org/2017/1035
Tassos Dimitriou
Participatory or crowd-sensing applications process sensory data contributed by users and transform them to simple visualizations (such as for example noise or pollution levels) that help create an accurate representation of...
last revised 26 Oct 2017
Data Is a Stream: Security of Stream-Based Channels
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27281
Marc Fischlin Felix Günther Giorgia Azzurra Marson Kenneth G. Paterson
Crypto 2015
0-RTT Key Exchange with Full Forward Secrecy
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28036
Felix Günther Britta Hale Tibor Jager Sebastian Lauer
Eurocrypt 2017
PRF-ODH: Relations, Instantiations, and Impossibility Results
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28203
Jacqueline Brendel Marc Fischlin Felix Günther Christian Janson
Crypto 2017
A Formal Treatment of Multi-key Channels
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28246
Felix Günther Sogol Mazaheri
Crypto 2017
Provably Secure Framework for Information Aggregation is Sensor Networks
Eprint
https://eprint.iacr.org/2007/283
Mark Manulis Joerg Schwenk
Information aggregation is an important operation in wireless sensor networks executed for the purpose of monitoring and reporting of the environmental data. Due to the performance constraints of sensor nodes the in-network...
last revised 14 Oct 2008
Mark Manulis
Author
https://iacr.org/cryptodb/data/author.php?authorkey=3432
University of Surrey
Cryptographic Treatment of Private User Profiles
Eprint
https://eprint.iacr.org/2011/064
Felix Günther Mark Manulis Thorsten Strufe
The publication of private data in user profiles in a both secure and private way is a rising problem and of special interest in, e.g., online social networks that become more and more popular. Current approaches, especially...
received 3 Feb 2011
More Efficient Universal Circuit Constructions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28306
Daniel Günther Ágnes Kiss Thomas Schneider
Asiacrypt 2017
Privacy-Enhanced Searches Using Encrypted Bloom Filters
Eprint
https://eprint.iacr.org/2004/022
Steven M. Bellovin William R. Cheswick
It is often necessary for two or more or more parties that do not fully trust each other to selectively share data. We propose a search scheme based on Bloom filters and Pohlig-Hellman encryption. A semi-trusted third party...
received 1 Feb 2004
External Reviewers, IACR CRYPTO 2012
https://iacr.org/archive/crypto2012/external.html
External Reviewers, IACR CRYPTO 2012 Masayuki Abe Hadi Ahmadi Mohsen Alimomeni Jacob Alperin-Sheriff Elena Andreeva Kazumaro Aoki Yoshinori Aono Gilad Asharov Jean-Philippe Aumasson Paul Baecher Thomas Baignéres Josep Balasch...
External Reviewers for IACR Theory of Cryptography (TCC) 2016-B
https://iacr.org/archive/tcc2016b/external.html
External Reviewers for IACR Theory of Cryptography (TCC) 2016-B Hamza Abusalah Shashank Agrawal Shweta Agrawal Joël Alwen Prabhanjan Ananth Saikrishna Badrinarayanan Marshall Ball Raef Bassily Carsten Baum Amos Beimel Fabrice...
Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance
Eprint
https://eprint.iacr.org/2018/914
Shuichi Katsumata Shota Yamada
Constrained pseudorandom functions (CPRFs) are a type of PRFs that allows one to derive a constrained key $\mathsf{K}_C$ from the master key $\mathsf{K}$. While the master key $\mathsf{K}$ allows one to evaluate on any input...
last revised 19 Oct 2018
Compactness vs Collusion Resistance in Functional Encryption
Eprint
https://eprint.iacr.org/2016/561
Baiyu Li Daniele Micciancio
We present two general constructions that can be used to combine any two functional encryption (FE) schemes (supporting a bounded number of key queries) into a new functional encryption scheme supporting a larger number of key...
last revised 10 Apr 2017
PUDA – Privacy and Unforgeability for Data Aggregation
Eprint
https://eprint.iacr.org/2015/562
Iraklis Leontiadis Kaoutar Elkhiyaoui Melek Önen Refik Molva
Existing work on data collection and analysis for aggregation is mainly focused on confidentiality issues. That is, the untrusted Aggregator learns only the aggregation result without divulging individual data inputs. In this...
last revised 18 Aug 2015
Constrained PRFs for Bit-fixing (and More) from OWFs with Adaptive Security and Constant Collusion Resistance
Eprint
https://eprint.iacr.org/2018/982
Alex Davidson Shuichi Katsumata Ryo Nishimaki Shota Yamada
Constrained pseudorandom functions (CPRFs) allow learning "constrained" PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh and Waters [AC'13],...
last revised 3 Jun 2019
Private and Dynamic Time-Series Data Aggregation with Trust Relaxation
Eprint
https://eprint.iacr.org/2014/256
Iraklis Leontiadis Kaoutar Elkhiyaoui Refik Molva
Abstract. With the advent of networking applications collecting user data on a massive scale, the privacy of individual users appears to be a major concern. The main challenge is the design of a solution that allows the data...
last revised 20 Feb 2015
A Bit-fixing PRF with O(1) Collusion-Resistance from LWE
Eprint
https://eprint.iacr.org/2018/890
Alex Davidson Ryo Nishimaki
Constrained pseudorandom functions (CPRFs) allow learning modified PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh and Waters [Asiacrypt 2013],...
last revised 18 Oct 2018
Privacy-Preserving Aggregation of Time-Series Data with Public Verifiability from Simple Assumptions
Eprint
https://eprint.iacr.org/2017/479
Keita Emura
Aggregator oblivious encryption was proposed by Shi et al. (NDSS 2011), where an aggregator can compute an aggregated sum of data and is unable to learn anything else (aggregator obliviousness). Since the aggregator does not...
last revised 24 Jul 2017
Next ►